/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 16:21:00,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 16:21:00,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 16:21:00,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 16:21:00,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 16:21:00,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 16:21:00,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 16:21:00,644 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 16:21:00,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 16:21:00,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 16:21:00,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 16:21:00,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 16:21:00,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 16:21:00,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 16:21:00,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 16:21:00,664 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 16:21:00,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 16:21:00,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 16:21:00,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 16:21:00,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 16:21:00,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 16:21:00,677 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 16:21:00,678 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 16:21:00,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 16:21:00,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 16:21:00,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 16:21:00,684 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 16:21:00,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 16:21:00,687 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 16:21:00,689 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 16:21:00,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 16:21:00,690 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 16:21:00,692 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 16:21:00,693 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 16:21:00,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 16:21:00,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 16:21:00,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 16:21:00,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 16:21:00,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 16:21:00,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 16:21:00,697 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 16:21:00,700 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 16:21:00,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 16:21:00,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 16:21:00,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 16:21:00,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 16:21:00,722 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 16:21:00,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 16:21:00,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 16:21:00,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 16:21:00,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 16:21:00,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 16:21:00,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 16:21:00,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 16:21:00,725 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 16:21:00,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 16:21:00,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 16:21:00,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 16:21:00,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 16:21:00,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 16:21:00,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 16:21:00,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 16:21:00,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 16:21:00,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:21:00,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 16:21:00,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 16:21:00,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 16:21:00,728 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 16:21:00,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 16:21:00,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 16:21:00,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 16:21:01,030 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 16:21:01,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 16:21:01,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 16:21:01,049 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 16:21:01,049 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 16:21:01,050 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 16:21:01,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c57a20bc/755907d855ab4060a57794fa958f883d/FLAG82e39933e [2019-12-18 16:21:01,703 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 16:21:01,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.oepc.i [2019-12-18 16:21:01,718 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c57a20bc/755907d855ab4060a57794fa958f883d/FLAG82e39933e [2019-12-18 16:21:02,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c57a20bc/755907d855ab4060a57794fa958f883d [2019-12-18 16:21:02,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 16:21:02,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 16:21:02,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 16:21:02,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 16:21:02,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 16:21:02,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2908c1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02, skipping insertion in model container [2019-12-18 16:21:02,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 16:21:02,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 16:21:02,559 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:21:02,572 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 16:21:02,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 16:21:02,764 INFO L208 MainTranslator]: Completed translation [2019-12-18 16:21:02,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02 WrapperNode [2019-12-18 16:21:02,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 16:21:02,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 16:21:02,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 16:21:02,767 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 16:21:02,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 16:21:02,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 16:21:02,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 16:21:02,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 16:21:02,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... [2019-12-18 16:21:02,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 16:21:02,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 16:21:02,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 16:21:02,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 16:21:02,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 16:21:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 16:21:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 16:21:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 16:21:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 16:21:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 16:21:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 16:21:02,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 16:21:02,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 16:21:02,940 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 16:21:02,940 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 16:21:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 16:21:02,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 16:21:02,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 16:21:02,945 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 16:21:03,737 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 16:21:03,738 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 16:21:03,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:21:03 BoogieIcfgContainer [2019-12-18 16:21:03,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 16:21:03,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 16:21:03,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 16:21:03,744 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 16:21:03,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 04:21:02" (1/3) ... [2019-12-18 16:21:03,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a537125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:21:03, skipping insertion in model container [2019-12-18 16:21:03,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 04:21:02" (2/3) ... [2019-12-18 16:21:03,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a537125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 04:21:03, skipping insertion in model container [2019-12-18 16:21:03,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 04:21:03" (3/3) ... [2019-12-18 16:21:03,748 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.oepc.i [2019-12-18 16:21:03,758 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 16:21:03,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 16:21:03,765 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 16:21:03,768 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 16:21:03,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,811 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,812 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,813 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,844 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,851 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,852 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,870 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,871 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,879 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,881 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,882 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,883 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,884 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,889 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,896 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 16:21:03,916 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 16:21:03,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 16:21:03,937 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 16:21:03,937 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 16:21:03,937 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 16:21:03,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 16:21:03,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 16:21:03,938 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 16:21:03,938 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 16:21:03,955 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-18 16:21:03,957 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:21:04,052 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:21:04,052 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:21:04,071 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:21:04,101 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-18 16:21:04,176 INFO L126 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-18 16:21:04,177 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 16:21:04,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 426 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 16:21:04,207 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 16:21:04,208 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 16:21:09,656 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:21:09,777 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 16:21:10,106 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 16:21:10,237 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 16:21:10,265 INFO L206 etLargeBlockEncoding]: Checked pairs total: 90866 [2019-12-18 16:21:10,265 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-18 16:21:10,269 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 103 transitions [2019-12-18 16:21:31,369 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 123302 states. [2019-12-18 16:21:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 123302 states. [2019-12-18 16:21:31,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 16:21:31,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:31,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 16:21:31,377 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash 918873, now seen corresponding path program 1 times [2019-12-18 16:21:31,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:31,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146215204] [2019-12-18 16:21:31,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:31,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146215204] [2019-12-18 16:21:31,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:31,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:21:31,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582812136] [2019-12-18 16:21:31,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:21:31,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:21:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:31,646 INFO L87 Difference]: Start difference. First operand 123302 states. Second operand 3 states. [2019-12-18 16:21:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:35,548 INFO L93 Difference]: Finished difference Result 122174 states and 518852 transitions. [2019-12-18 16:21:35,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:21:35,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 16:21:35,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:36,244 INFO L225 Difference]: With dead ends: 122174 [2019-12-18 16:21:36,245 INFO L226 Difference]: Without dead ends: 115076 [2019-12-18 16:21:36,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:21:41,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115076 states. [2019-12-18 16:21:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115076 to 115076. [2019-12-18 16:21:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115076 states. [2019-12-18 16:21:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115076 states to 115076 states and 488094 transitions. [2019-12-18 16:21:47,469 INFO L78 Accepts]: Start accepts. Automaton has 115076 states and 488094 transitions. Word has length 3 [2019-12-18 16:21:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:21:47,470 INFO L462 AbstractCegarLoop]: Abstraction has 115076 states and 488094 transitions. [2019-12-18 16:21:47,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:21:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 115076 states and 488094 transitions. [2019-12-18 16:21:47,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 16:21:47,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:21:47,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:21:47,474 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:21:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:21:47,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1360334080, now seen corresponding path program 1 times [2019-12-18 16:21:47,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:21:47,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141166530] [2019-12-18 16:21:47,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:21:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:21:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:21:47,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141166530] [2019-12-18 16:21:47,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:21:47,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:21:47,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887795452] [2019-12-18 16:21:47,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:21:47,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:21:47,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:21:47,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:21:47,611 INFO L87 Difference]: Start difference. First operand 115076 states and 488094 transitions. Second operand 4 states. [2019-12-18 16:21:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:21:53,516 INFO L93 Difference]: Finished difference Result 178684 states and 728513 transitions. [2019-12-18 16:21:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:21:53,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 16:21:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:21:54,210 INFO L225 Difference]: With dead ends: 178684 [2019-12-18 16:21:54,211 INFO L226 Difference]: Without dead ends: 178635 [2019-12-18 16:21:54,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:22:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178635 states. [2019-12-18 16:22:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178635 to 162755. [2019-12-18 16:22:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162755 states. [2019-12-18 16:22:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162755 states to 162755 states and 672033 transitions. [2019-12-18 16:22:04,256 INFO L78 Accepts]: Start accepts. Automaton has 162755 states and 672033 transitions. Word has length 11 [2019-12-18 16:22:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:04,256 INFO L462 AbstractCegarLoop]: Abstraction has 162755 states and 672033 transitions. [2019-12-18 16:22:04,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:22:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 162755 states and 672033 transitions. [2019-12-18 16:22:04,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 16:22:04,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:04,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:04,265 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:04,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:04,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1888852276, now seen corresponding path program 1 times [2019-12-18 16:22:04,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:04,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527804511] [2019-12-18 16:22:04,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:04,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527804511] [2019-12-18 16:22:04,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:04,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:22:04,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245245107] [2019-12-18 16:22:04,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:04,343 INFO L87 Difference]: Start difference. First operand 162755 states and 672033 transitions. Second operand 3 states. [2019-12-18 16:22:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:04,481 INFO L93 Difference]: Finished difference Result 34587 states and 111811 transitions. [2019-12-18 16:22:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:04,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 16:22:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:04,557 INFO L225 Difference]: With dead ends: 34587 [2019-12-18 16:22:04,557 INFO L226 Difference]: Without dead ends: 34587 [2019-12-18 16:22:04,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:09,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34587 states. [2019-12-18 16:22:10,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34587 to 34587. [2019-12-18 16:22:10,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34587 states. [2019-12-18 16:22:10,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34587 states to 34587 states and 111811 transitions. [2019-12-18 16:22:10,286 INFO L78 Accepts]: Start accepts. Automaton has 34587 states and 111811 transitions. Word has length 13 [2019-12-18 16:22:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:10,286 INFO L462 AbstractCegarLoop]: Abstraction has 34587 states and 111811 transitions. [2019-12-18 16:22:10,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:10,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34587 states and 111811 transitions. [2019-12-18 16:22:10,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 16:22:10,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:10,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:10,290 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:10,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1220224201, now seen corresponding path program 1 times [2019-12-18 16:22:10,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:10,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093678600] [2019-12-18 16:22:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:10,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093678600] [2019-12-18 16:22:10,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:10,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:22:10,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427032345] [2019-12-18 16:22:10,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:22:10,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:10,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:22:10,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:22:10,377 INFO L87 Difference]: Start difference. First operand 34587 states and 111811 transitions. Second operand 5 states. [2019-12-18 16:22:10,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:10,923 INFO L93 Difference]: Finished difference Result 47506 states and 151809 transitions. [2019-12-18 16:22:10,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 16:22:10,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 16:22:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:11,007 INFO L225 Difference]: With dead ends: 47506 [2019-12-18 16:22:11,007 INFO L226 Difference]: Without dead ends: 47506 [2019-12-18 16:22:11,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:22:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47506 states. [2019-12-18 16:22:11,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47506 to 39981. [2019-12-18 16:22:11,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39981 states. [2019-12-18 16:22:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39981 states to 39981 states and 128832 transitions. [2019-12-18 16:22:12,308 INFO L78 Accepts]: Start accepts. Automaton has 39981 states and 128832 transitions. Word has length 16 [2019-12-18 16:22:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:12,309 INFO L462 AbstractCegarLoop]: Abstraction has 39981 states and 128832 transitions. [2019-12-18 16:22:12,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:22:12,309 INFO L276 IsEmpty]: Start isEmpty. Operand 39981 states and 128832 transitions. [2019-12-18 16:22:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 16:22:12,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:12,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:12,318 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1720601530, now seen corresponding path program 1 times [2019-12-18 16:22:12,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:12,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640700280] [2019-12-18 16:22:12,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:12,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640700280] [2019-12-18 16:22:12,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:12,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:22:12,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531006288] [2019-12-18 16:22:12,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:22:12,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:12,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:22:12,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:22:12,417 INFO L87 Difference]: Start difference. First operand 39981 states and 128832 transitions. Second operand 6 states. [2019-12-18 16:22:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:13,350 INFO L93 Difference]: Finished difference Result 59624 states and 187628 transitions. [2019-12-18 16:22:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:22:13,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 16:22:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:13,459 INFO L225 Difference]: With dead ends: 59624 [2019-12-18 16:22:13,459 INFO L226 Difference]: Without dead ends: 59617 [2019-12-18 16:22:13,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 16:22:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59617 states. [2019-12-18 16:22:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59617 to 40463. [2019-12-18 16:22:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40463 states. [2019-12-18 16:22:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40463 states to 40463 states and 129749 transitions. [2019-12-18 16:22:14,342 INFO L78 Accepts]: Start accepts. Automaton has 40463 states and 129749 transitions. Word has length 22 [2019-12-18 16:22:14,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:14,342 INFO L462 AbstractCegarLoop]: Abstraction has 40463 states and 129749 transitions. [2019-12-18 16:22:14,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:22:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 40463 states and 129749 transitions. [2019-12-18 16:22:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 16:22:14,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:14,356 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:14,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:14,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:14,357 INFO L82 PathProgramCache]: Analyzing trace with hash -74763598, now seen corresponding path program 1 times [2019-12-18 16:22:14,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:14,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126063749] [2019-12-18 16:22:14,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:14,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126063749] [2019-12-18 16:22:14,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:14,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:22:14,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639452559] [2019-12-18 16:22:14,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 16:22:14,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 16:22:14,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:22:14,423 INFO L87 Difference]: Start difference. First operand 40463 states and 129749 transitions. Second operand 4 states. [2019-12-18 16:22:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:14,499 INFO L93 Difference]: Finished difference Result 16096 states and 48753 transitions. [2019-12-18 16:22:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 16:22:14,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 16:22:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:14,522 INFO L225 Difference]: With dead ends: 16096 [2019-12-18 16:22:14,522 INFO L226 Difference]: Without dead ends: 16096 [2019-12-18 16:22:14,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 16:22:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16096 states. [2019-12-18 16:22:14,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16096 to 15803. [2019-12-18 16:22:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15803 states. [2019-12-18 16:22:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15803 states to 15803 states and 47917 transitions. [2019-12-18 16:22:14,765 INFO L78 Accepts]: Start accepts. Automaton has 15803 states and 47917 transitions. Word has length 25 [2019-12-18 16:22:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:14,765 INFO L462 AbstractCegarLoop]: Abstraction has 15803 states and 47917 transitions. [2019-12-18 16:22:14,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 16:22:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15803 states and 47917 transitions. [2019-12-18 16:22:14,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 16:22:14,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:14,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:14,777 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:14,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1856606199, now seen corresponding path program 1 times [2019-12-18 16:22:14,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:14,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690358749] [2019-12-18 16:22:14,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:14,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690358749] [2019-12-18 16:22:14,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:14,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:22:14,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418152453] [2019-12-18 16:22:14,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:22:14,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:22:14,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:22:14,880 INFO L87 Difference]: Start difference. First operand 15803 states and 47917 transitions. Second operand 6 states. [2019-12-18 16:22:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:15,684 INFO L93 Difference]: Finished difference Result 22779 states and 67340 transitions. [2019-12-18 16:22:15,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 16:22:15,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 16:22:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:15,719 INFO L225 Difference]: With dead ends: 22779 [2019-12-18 16:22:15,719 INFO L226 Difference]: Without dead ends: 22779 [2019-12-18 16:22:15,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:22:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22779 states. [2019-12-18 16:22:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22779 to 18120. [2019-12-18 16:22:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18120 states. [2019-12-18 16:22:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18120 states to 18120 states and 54739 transitions. [2019-12-18 16:22:16,041 INFO L78 Accepts]: Start accepts. Automaton has 18120 states and 54739 transitions. Word has length 27 [2019-12-18 16:22:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:16,042 INFO L462 AbstractCegarLoop]: Abstraction has 18120 states and 54739 transitions. [2019-12-18 16:22:16,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:22:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 18120 states and 54739 transitions. [2019-12-18 16:22:16,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 16:22:16,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:16,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:16,060 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1731527828, now seen corresponding path program 1 times [2019-12-18 16:22:16,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:16,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222492221] [2019-12-18 16:22:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:16,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222492221] [2019-12-18 16:22:16,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:16,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 16:22:16,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847977492] [2019-12-18 16:22:16,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:22:16,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:22:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:22:16,164 INFO L87 Difference]: Start difference. First operand 18120 states and 54739 transitions. Second operand 7 states. [2019-12-18 16:22:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:17,244 INFO L93 Difference]: Finished difference Result 24798 states and 73024 transitions. [2019-12-18 16:22:17,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 16:22:17,245 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 16:22:17,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:17,279 INFO L225 Difference]: With dead ends: 24798 [2019-12-18 16:22:17,279 INFO L226 Difference]: Without dead ends: 24798 [2019-12-18 16:22:17,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 16:22:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24798 states. [2019-12-18 16:22:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24798 to 16706. [2019-12-18 16:22:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16706 states. [2019-12-18 16:22:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16706 states to 16706 states and 50524 transitions. [2019-12-18 16:22:17,572 INFO L78 Accepts]: Start accepts. Automaton has 16706 states and 50524 transitions. Word has length 33 [2019-12-18 16:22:17,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:17,573 INFO L462 AbstractCegarLoop]: Abstraction has 16706 states and 50524 transitions. [2019-12-18 16:22:17,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:22:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 16706 states and 50524 transitions. [2019-12-18 16:22:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:22:17,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:17,595 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:17,595 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:17,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:17,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1723865273, now seen corresponding path program 1 times [2019-12-18 16:22:17,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:17,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953132572] [2019-12-18 16:22:17,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:17,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953132572] [2019-12-18 16:22:17,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:17,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:22:17,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29933] [2019-12-18 16:22:17,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:17,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:17,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:17,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:17,665 INFO L87 Difference]: Start difference. First operand 16706 states and 50524 transitions. Second operand 3 states. [2019-12-18 16:22:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:17,768 INFO L93 Difference]: Finished difference Result 28297 states and 85903 transitions. [2019-12-18 16:22:17,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:17,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:22:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:17,794 INFO L225 Difference]: With dead ends: 28297 [2019-12-18 16:22:17,794 INFO L226 Difference]: Without dead ends: 14210 [2019-12-18 16:22:17,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:17,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14210 states. [2019-12-18 16:22:17,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14210 to 14150. [2019-12-18 16:22:17,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14150 states. [2019-12-18 16:22:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14150 states to 14150 states and 42128 transitions. [2019-12-18 16:22:18,019 INFO L78 Accepts]: Start accepts. Automaton has 14150 states and 42128 transitions. Word has length 39 [2019-12-18 16:22:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:18,020 INFO L462 AbstractCegarLoop]: Abstraction has 14150 states and 42128 transitions. [2019-12-18 16:22:18,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 14150 states and 42128 transitions. [2019-12-18 16:22:18,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 16:22:18,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:18,036 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:18,036 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1940280365, now seen corresponding path program 2 times [2019-12-18 16:22:18,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:18,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466704596] [2019-12-18 16:22:18,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:18,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466704596] [2019-12-18 16:22:18,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:18,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 16:22:18,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986711736] [2019-12-18 16:22:18,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:18,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:18,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:18,091 INFO L87 Difference]: Start difference. First operand 14150 states and 42128 transitions. Second operand 3 states. [2019-12-18 16:22:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:18,149 INFO L93 Difference]: Finished difference Result 14149 states and 42126 transitions. [2019-12-18 16:22:18,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:18,150 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 16:22:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:18,172 INFO L225 Difference]: With dead ends: 14149 [2019-12-18 16:22:18,172 INFO L226 Difference]: Without dead ends: 14149 [2019-12-18 16:22:18,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14149 states. [2019-12-18 16:22:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14149 to 14149. [2019-12-18 16:22:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-18 16:22:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 42126 transitions. [2019-12-18 16:22:18,783 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 42126 transitions. Word has length 39 [2019-12-18 16:22:18,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:18,783 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 42126 transitions. [2019-12-18 16:22:18,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 42126 transitions. [2019-12-18 16:22:18,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 16:22:18,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:18,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:18,813 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:18,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:18,813 INFO L82 PathProgramCache]: Analyzing trace with hash 140069502, now seen corresponding path program 1 times [2019-12-18 16:22:18,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:18,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474070387] [2019-12-18 16:22:18,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:18,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474070387] [2019-12-18 16:22:18,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:18,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 16:22:18,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7187836] [2019-12-18 16:22:18,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 16:22:18,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 16:22:18,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:22:18,906 INFO L87 Difference]: Start difference. First operand 14149 states and 42126 transitions. Second operand 5 states. [2019-12-18 16:22:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:18,984 INFO L93 Difference]: Finished difference Result 13093 states and 39713 transitions. [2019-12-18 16:22:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 16:22:18,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 16:22:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:19,005 INFO L225 Difference]: With dead ends: 13093 [2019-12-18 16:22:19,005 INFO L226 Difference]: Without dead ends: 11563 [2019-12-18 16:22:19,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 16:22:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2019-12-18 16:22:19,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 11150. [2019-12-18 16:22:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11150 states. [2019-12-18 16:22:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11150 states to 11150 states and 34836 transitions. [2019-12-18 16:22:19,290 INFO L78 Accepts]: Start accepts. Automaton has 11150 states and 34836 transitions. Word has length 40 [2019-12-18 16:22:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:19,291 INFO L462 AbstractCegarLoop]: Abstraction has 11150 states and 34836 transitions. [2019-12-18 16:22:19,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 16:22:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11150 states and 34836 transitions. [2019-12-18 16:22:19,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:19,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:19,309 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:19,309 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:19,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:19,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1749898488, now seen corresponding path program 1 times [2019-12-18 16:22:19,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:19,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071600801] [2019-12-18 16:22:19,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:19,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:19,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071600801] [2019-12-18 16:22:19,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:19,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:22:19,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521939798] [2019-12-18 16:22:19,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:19,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:19,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:19,368 INFO L87 Difference]: Start difference. First operand 11150 states and 34836 transitions. Second operand 3 states. [2019-12-18 16:22:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:19,466 INFO L93 Difference]: Finished difference Result 17888 states and 54761 transitions. [2019-12-18 16:22:19,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:19,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:22:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:19,498 INFO L225 Difference]: With dead ends: 17888 [2019-12-18 16:22:19,498 INFO L226 Difference]: Without dead ends: 17888 [2019-12-18 16:22:19,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17888 states. [2019-12-18 16:22:19,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17888 to 12900. [2019-12-18 16:22:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12900 states. [2019-12-18 16:22:19,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12900 states to 12900 states and 39991 transitions. [2019-12-18 16:22:19,839 INFO L78 Accepts]: Start accepts. Automaton has 12900 states and 39991 transitions. Word has length 64 [2019-12-18 16:22:19,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:19,839 INFO L462 AbstractCegarLoop]: Abstraction has 12900 states and 39991 transitions. [2019-12-18 16:22:19,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:19,840 INFO L276 IsEmpty]: Start isEmpty. Operand 12900 states and 39991 transitions. [2019-12-18 16:22:19,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:19,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:19,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:19,854 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1943324054, now seen corresponding path program 1 times [2019-12-18 16:22:19,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:19,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287447216] [2019-12-18 16:22:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:19,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287447216] [2019-12-18 16:22:19,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:19,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:22:19,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654764909] [2019-12-18 16:22:19,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:22:19,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:19,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:22:19,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:22:19,957 INFO L87 Difference]: Start difference. First operand 12900 states and 39991 transitions. Second operand 7 states. [2019-12-18 16:22:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:20,425 INFO L93 Difference]: Finished difference Result 37114 states and 114341 transitions. [2019-12-18 16:22:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:22:20,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:22:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:20,464 INFO L225 Difference]: With dead ends: 37114 [2019-12-18 16:22:20,465 INFO L226 Difference]: Without dead ends: 27250 [2019-12-18 16:22:20,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:22:20,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27250 states. [2019-12-18 16:22:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27250 to 15594. [2019-12-18 16:22:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15594 states. [2019-12-18 16:22:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15594 states to 15594 states and 48552 transitions. [2019-12-18 16:22:20,812 INFO L78 Accepts]: Start accepts. Automaton has 15594 states and 48552 transitions. Word has length 64 [2019-12-18 16:22:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:20,812 INFO L462 AbstractCegarLoop]: Abstraction has 15594 states and 48552 transitions. [2019-12-18 16:22:20,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:22:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 15594 states and 48552 transitions. [2019-12-18 16:22:20,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:20,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:20,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:20,833 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:20,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1388273988, now seen corresponding path program 2 times [2019-12-18 16:22:20,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:20,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879662963] [2019-12-18 16:22:20,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:20,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:20,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879662963] [2019-12-18 16:22:20,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:20,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:22:20,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723538393] [2019-12-18 16:22:20,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:22:20,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:20,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:22:20,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:22:20,926 INFO L87 Difference]: Start difference. First operand 15594 states and 48552 transitions. Second operand 7 states. [2019-12-18 16:22:21,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:21,388 INFO L93 Difference]: Finished difference Result 41160 states and 125962 transitions. [2019-12-18 16:22:21,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 16:22:21,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:22:21,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:21,432 INFO L225 Difference]: With dead ends: 41160 [2019-12-18 16:22:21,432 INFO L226 Difference]: Without dead ends: 29917 [2019-12-18 16:22:21,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 16:22:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29917 states. [2019-12-18 16:22:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29917 to 18174. [2019-12-18 16:22:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18174 states. [2019-12-18 16:22:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18174 states to 18174 states and 56555 transitions. [2019-12-18 16:22:22,096 INFO L78 Accepts]: Start accepts. Automaton has 18174 states and 56555 transitions. Word has length 64 [2019-12-18 16:22:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:22,097 INFO L462 AbstractCegarLoop]: Abstraction has 18174 states and 56555 transitions. [2019-12-18 16:22:22,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:22:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 18174 states and 56555 transitions. [2019-12-18 16:22:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:22,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:22,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:22,124 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:22,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1006987750, now seen corresponding path program 3 times [2019-12-18 16:22:22,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:22,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451872728] [2019-12-18 16:22:22,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:22,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:22,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451872728] [2019-12-18 16:22:22,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:22,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:22:22,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356064817] [2019-12-18 16:22:22,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:22:22,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:22,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:22:22,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:22:22,243 INFO L87 Difference]: Start difference. First operand 18174 states and 56555 transitions. Second operand 9 states. [2019-12-18 16:22:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:23,743 INFO L93 Difference]: Finished difference Result 69591 states and 211239 transitions. [2019-12-18 16:22:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 16:22:23,744 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:22:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:23,846 INFO L225 Difference]: With dead ends: 69591 [2019-12-18 16:22:23,846 INFO L226 Difference]: Without dead ends: 65149 [2019-12-18 16:22:23,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2019-12-18 16:22:24,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65149 states. [2019-12-18 16:22:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65149 to 18319. [2019-12-18 16:22:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18319 states. [2019-12-18 16:22:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18319 states to 18319 states and 57144 transitions. [2019-12-18 16:22:24,493 INFO L78 Accepts]: Start accepts. Automaton has 18319 states and 57144 transitions. Word has length 64 [2019-12-18 16:22:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:24,493 INFO L462 AbstractCegarLoop]: Abstraction has 18319 states and 57144 transitions. [2019-12-18 16:22:24,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:22:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18319 states and 57144 transitions. [2019-12-18 16:22:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:24,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:24,514 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:24,514 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1302254906, now seen corresponding path program 1 times [2019-12-18 16:22:24,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:24,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349406754] [2019-12-18 16:22:24,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:24,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349406754] [2019-12-18 16:22:24,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:24,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 16:22:24,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34132064] [2019-12-18 16:22:24,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:24,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:24,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:24,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:24,565 INFO L87 Difference]: Start difference. First operand 18319 states and 57144 transitions. Second operand 3 states. [2019-12-18 16:22:24,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:24,694 INFO L93 Difference]: Finished difference Result 23765 states and 72382 transitions. [2019-12-18 16:22:24,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:24,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:22:24,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:24,737 INFO L225 Difference]: With dead ends: 23765 [2019-12-18 16:22:24,737 INFO L226 Difference]: Without dead ends: 23765 [2019-12-18 16:22:24,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:24,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23765 states. [2019-12-18 16:22:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23765 to 18819. [2019-12-18 16:22:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18819 states. [2019-12-18 16:22:25,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 57725 transitions. [2019-12-18 16:22:25,203 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 57725 transitions. Word has length 64 [2019-12-18 16:22:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:25,204 INFO L462 AbstractCegarLoop]: Abstraction has 18819 states and 57725 transitions. [2019-12-18 16:22:25,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 57725 transitions. [2019-12-18 16:22:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:25,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:25,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:25,226 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:25,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:25,226 INFO L82 PathProgramCache]: Analyzing trace with hash 479548822, now seen corresponding path program 4 times [2019-12-18 16:22:25,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:25,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81156483] [2019-12-18 16:22:25,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:25,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:25,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81156483] [2019-12-18 16:22:25,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:25,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:22:25,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228901912] [2019-12-18 16:22:25,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:22:25,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:25,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:22:25,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:22:25,339 INFO L87 Difference]: Start difference. First operand 18819 states and 57725 transitions. Second operand 9 states. [2019-12-18 16:22:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:26,794 INFO L93 Difference]: Finished difference Result 63866 states and 192746 transitions. [2019-12-18 16:22:26,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:22:26,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 16:22:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:26,881 INFO L225 Difference]: With dead ends: 63866 [2019-12-18 16:22:26,881 INFO L226 Difference]: Without dead ends: 61442 [2019-12-18 16:22:26,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:22:27,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61442 states. [2019-12-18 16:22:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61442 to 18847. [2019-12-18 16:22:27,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18847 states. [2019-12-18 16:22:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18847 states to 18847 states and 57879 transitions. [2019-12-18 16:22:27,496 INFO L78 Accepts]: Start accepts. Automaton has 18847 states and 57879 transitions. Word has length 64 [2019-12-18 16:22:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:27,496 INFO L462 AbstractCegarLoop]: Abstraction has 18847 states and 57879 transitions. [2019-12-18 16:22:27,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:22:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 18847 states and 57879 transitions. [2019-12-18 16:22:27,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:27,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:27,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:27,515 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:27,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1651786320, now seen corresponding path program 5 times [2019-12-18 16:22:27,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:27,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260414959] [2019-12-18 16:22:27,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:27,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260414959] [2019-12-18 16:22:27,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:27,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 16:22:27,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968803992] [2019-12-18 16:22:27,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 16:22:27,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:27,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 16:22:27,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 16:22:27,617 INFO L87 Difference]: Start difference. First operand 18847 states and 57879 transitions. Second operand 7 states. [2019-12-18 16:22:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:28,640 INFO L93 Difference]: Finished difference Result 33314 states and 98781 transitions. [2019-12-18 16:22:28,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 16:22:28,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 16:22:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:28,686 INFO L225 Difference]: With dead ends: 33314 [2019-12-18 16:22:28,686 INFO L226 Difference]: Without dead ends: 33146 [2019-12-18 16:22:28,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-18 16:22:28,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33146 states. [2019-12-18 16:22:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33146 to 26403. [2019-12-18 16:22:29,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26403 states. [2019-12-18 16:22:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26403 states to 26403 states and 79272 transitions. [2019-12-18 16:22:29,169 INFO L78 Accepts]: Start accepts. Automaton has 26403 states and 79272 transitions. Word has length 64 [2019-12-18 16:22:29,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:29,170 INFO L462 AbstractCegarLoop]: Abstraction has 26403 states and 79272 transitions. [2019-12-18 16:22:29,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 16:22:29,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26403 states and 79272 transitions. [2019-12-18 16:22:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 16:22:29,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:29,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:29,200 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:29,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2061800196, now seen corresponding path program 6 times [2019-12-18 16:22:29,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:29,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118289101] [2019-12-18 16:22:29,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:29,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:29,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118289101] [2019-12-18 16:22:29,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:29,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:22:29,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750893671] [2019-12-18 16:22:29,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:29,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:29,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:29,260 INFO L87 Difference]: Start difference. First operand 26403 states and 79272 transitions. Second operand 3 states. [2019-12-18 16:22:29,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:29,469 INFO L93 Difference]: Finished difference Result 31436 states and 94494 transitions. [2019-12-18 16:22:29,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:29,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 16:22:29,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:29,547 INFO L225 Difference]: With dead ends: 31436 [2019-12-18 16:22:29,547 INFO L226 Difference]: Without dead ends: 31436 [2019-12-18 16:22:29,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31436 states. [2019-12-18 16:22:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31436 to 26427. [2019-12-18 16:22:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26427 states. [2019-12-18 16:22:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26427 states to 26427 states and 79898 transitions. [2019-12-18 16:22:30,667 INFO L78 Accepts]: Start accepts. Automaton has 26427 states and 79898 transitions. Word has length 64 [2019-12-18 16:22:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:30,667 INFO L462 AbstractCegarLoop]: Abstraction has 26427 states and 79898 transitions. [2019-12-18 16:22:30,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 26427 states and 79898 transitions. [2019-12-18 16:22:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:30,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:30,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:30,710 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 996367564, now seen corresponding path program 1 times [2019-12-18 16:22:30,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:30,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722112916] [2019-12-18 16:22:30,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:30,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722112916] [2019-12-18 16:22:30,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:30,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:22:30,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457354015] [2019-12-18 16:22:30,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:22:30,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:22:30,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:22:30,851 INFO L87 Difference]: Start difference. First operand 26427 states and 79898 transitions. Second operand 9 states. [2019-12-18 16:22:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:32,366 INFO L93 Difference]: Finished difference Result 75091 states and 222713 transitions. [2019-12-18 16:22:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 16:22:32,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:22:32,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:32,537 INFO L225 Difference]: With dead ends: 75091 [2019-12-18 16:22:32,538 INFO L226 Difference]: Without dead ends: 70259 [2019-12-18 16:22:32,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:22:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70259 states. [2019-12-18 16:22:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70259 to 26572. [2019-12-18 16:22:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26572 states. [2019-12-18 16:22:33,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26572 states to 26572 states and 80425 transitions. [2019-12-18 16:22:33,324 INFO L78 Accepts]: Start accepts. Automaton has 26572 states and 80425 transitions. Word has length 65 [2019-12-18 16:22:33,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:33,325 INFO L462 AbstractCegarLoop]: Abstraction has 26572 states and 80425 transitions. [2019-12-18 16:22:33,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:22:33,325 INFO L276 IsEmpty]: Start isEmpty. Operand 26572 states and 80425 transitions. [2019-12-18 16:22:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:33,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:33,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:33,352 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:33,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:33,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2045608364, now seen corresponding path program 2 times [2019-12-18 16:22:33,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:33,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71112483] [2019-12-18 16:22:33,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:33,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:33,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:33,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71112483] [2019-12-18 16:22:33,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:33,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:22:33,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151467831] [2019-12-18 16:22:33,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 16:22:33,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:33,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 16:22:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 16:22:33,472 INFO L87 Difference]: Start difference. First operand 26572 states and 80425 transitions. Second operand 9 states. [2019-12-18 16:22:35,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:35,026 INFO L93 Difference]: Finished difference Result 80705 states and 239117 transitions. [2019-12-18 16:22:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:22:35,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 16:22:35,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:35,132 INFO L225 Difference]: With dead ends: 80705 [2019-12-18 16:22:35,132 INFO L226 Difference]: Without dead ends: 75905 [2019-12-18 16:22:35,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:22:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75905 states. [2019-12-18 16:22:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75905 to 26453. [2019-12-18 16:22:35,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26453 states. [2019-12-18 16:22:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26453 states to 26453 states and 79873 transitions. [2019-12-18 16:22:35,942 INFO L78 Accepts]: Start accepts. Automaton has 26453 states and 79873 transitions. Word has length 65 [2019-12-18 16:22:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:35,942 INFO L462 AbstractCegarLoop]: Abstraction has 26453 states and 79873 transitions. [2019-12-18 16:22:35,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 16:22:35,942 INFO L276 IsEmpty]: Start isEmpty. Operand 26453 states and 79873 transitions. [2019-12-18 16:22:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:35,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:35,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:35,971 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash -848247963, now seen corresponding path program 1 times [2019-12-18 16:22:35,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:35,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420337257] [2019-12-18 16:22:35,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:36,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420337257] [2019-12-18 16:22:36,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:36,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:22:36,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437541379] [2019-12-18 16:22:36,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:22:36,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:36,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:22:36,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:22:36,165 INFO L87 Difference]: Start difference. First operand 26453 states and 79873 transitions. Second operand 12 states. [2019-12-18 16:22:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:38,744 INFO L93 Difference]: Finished difference Result 41763 states and 123043 transitions. [2019-12-18 16:22:38,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 16:22:38,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-12-18 16:22:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:38,798 INFO L225 Difference]: With dead ends: 41763 [2019-12-18 16:22:38,798 INFO L226 Difference]: Without dead ends: 41523 [2019-12-18 16:22:38,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1122, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 16:22:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41523 states. [2019-12-18 16:22:39,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41523 to 28887. [2019-12-18 16:22:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28887 states. [2019-12-18 16:22:39,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28887 states to 28887 states and 87051 transitions. [2019-12-18 16:22:39,767 INFO L78 Accepts]: Start accepts. Automaton has 28887 states and 87051 transitions. Word has length 65 [2019-12-18 16:22:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:39,768 INFO L462 AbstractCegarLoop]: Abstraction has 28887 states and 87051 transitions. [2019-12-18 16:22:39,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:22:39,768 INFO L276 IsEmpty]: Start isEmpty. Operand 28887 states and 87051 transitions. [2019-12-18 16:22:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:39,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:39,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:39,796 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:39,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash -947164955, now seen corresponding path program 2 times [2019-12-18 16:22:39,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:39,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517412361] [2019-12-18 16:22:39,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:39,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517412361] [2019-12-18 16:22:39,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:39,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 16:22:39,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551169479] [2019-12-18 16:22:39,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 16:22:39,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:39,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 16:22:39,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 16:22:39,887 INFO L87 Difference]: Start difference. First operand 28887 states and 87051 transitions. Second operand 6 states. [2019-12-18 16:22:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:40,518 INFO L93 Difference]: Finished difference Result 35840 states and 106531 transitions. [2019-12-18 16:22:40,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 16:22:40,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 16:22:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:40,565 INFO L225 Difference]: With dead ends: 35840 [2019-12-18 16:22:40,565 INFO L226 Difference]: Without dead ends: 35840 [2019-12-18 16:22:40,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 16:22:40,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35840 states. [2019-12-18 16:22:40,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35840 to 28862. [2019-12-18 16:22:40,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28862 states. [2019-12-18 16:22:41,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28862 states to 28862 states and 86928 transitions. [2019-12-18 16:22:41,041 INFO L78 Accepts]: Start accepts. Automaton has 28862 states and 86928 transitions. Word has length 65 [2019-12-18 16:22:41,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:41,041 INFO L462 AbstractCegarLoop]: Abstraction has 28862 states and 86928 transitions. [2019-12-18 16:22:41,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 16:22:41,042 INFO L276 IsEmpty]: Start isEmpty. Operand 28862 states and 86928 transitions. [2019-12-18 16:22:41,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:41,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:41,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:41,072 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:41,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:41,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1625168593, now seen corresponding path program 3 times [2019-12-18 16:22:41,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:41,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184322042] [2019-12-18 16:22:41,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:41,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184322042] [2019-12-18 16:22:41,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:41,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 16:22:41,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340588666] [2019-12-18 16:22:41,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:22:41,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:41,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:22:41,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:22:41,332 INFO L87 Difference]: Start difference. First operand 28862 states and 86928 transitions. Second operand 11 states. [2019-12-18 16:22:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:43,354 INFO L93 Difference]: Finished difference Result 45628 states and 136053 transitions. [2019-12-18 16:22:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 16:22:43,354 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-18 16:22:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:43,416 INFO L225 Difference]: With dead ends: 45628 [2019-12-18 16:22:43,416 INFO L226 Difference]: Without dead ends: 45408 [2019-12-18 16:22:43,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:22:43,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45408 states. [2019-12-18 16:22:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45408 to 34115. [2019-12-18 16:22:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34115 states. [2019-12-18 16:22:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34115 states to 34115 states and 102436 transitions. [2019-12-18 16:22:44,032 INFO L78 Accepts]: Start accepts. Automaton has 34115 states and 102436 transitions. Word has length 65 [2019-12-18 16:22:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:44,033 INFO L462 AbstractCegarLoop]: Abstraction has 34115 states and 102436 transitions. [2019-12-18 16:22:44,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:22:44,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34115 states and 102436 transitions. [2019-12-18 16:22:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 16:22:44,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:44,474 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:44,475 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:44,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:44,475 INFO L82 PathProgramCache]: Analyzing trace with hash -323165651, now seen corresponding path program 4 times [2019-12-18 16:22:44,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:44,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642692605] [2019-12-18 16:22:44,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:44,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642692605] [2019-12-18 16:22:44,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:44,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:22:44,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384158175] [2019-12-18 16:22:44,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:44,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:44,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:44,545 INFO L87 Difference]: Start difference. First operand 34115 states and 102436 transitions. Second operand 3 states. [2019-12-18 16:22:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:44,683 INFO L93 Difference]: Finished difference Result 34114 states and 102434 transitions. [2019-12-18 16:22:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:44,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 16:22:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:44,758 INFO L225 Difference]: With dead ends: 34114 [2019-12-18 16:22:44,759 INFO L226 Difference]: Without dead ends: 34114 [2019-12-18 16:22:44,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:44,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34114 states. [2019-12-18 16:22:45,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34114 to 24696. [2019-12-18 16:22:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24696 states. [2019-12-18 16:22:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24696 states to 24696 states and 75553 transitions. [2019-12-18 16:22:45,429 INFO L78 Accepts]: Start accepts. Automaton has 24696 states and 75553 transitions. Word has length 65 [2019-12-18 16:22:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:45,429 INFO L462 AbstractCegarLoop]: Abstraction has 24696 states and 75553 transitions. [2019-12-18 16:22:45,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 24696 states and 75553 transitions. [2019-12-18 16:22:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 16:22:45,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:45,460 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:45,460 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -458333570, now seen corresponding path program 1 times [2019-12-18 16:22:45,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:45,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616228513] [2019-12-18 16:22:45,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:45,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:45,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616228513] [2019-12-18 16:22:45,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:45,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 16:22:45,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910141464] [2019-12-18 16:22:45,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 16:22:45,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:45,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 16:22:45,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:45,562 INFO L87 Difference]: Start difference. First operand 24696 states and 75553 transitions. Second operand 3 states. [2019-12-18 16:22:45,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:45,647 INFO L93 Difference]: Finished difference Result 17851 states and 53976 transitions. [2019-12-18 16:22:45,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 16:22:45,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 16:22:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:45,678 INFO L225 Difference]: With dead ends: 17851 [2019-12-18 16:22:45,678 INFO L226 Difference]: Without dead ends: 17851 [2019-12-18 16:22:45,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 16:22:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17851 states. [2019-12-18 16:22:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17851 to 15564. [2019-12-18 16:22:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15564 states. [2019-12-18 16:22:45,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15564 states to 15564 states and 46981 transitions. [2019-12-18 16:22:45,938 INFO L78 Accepts]: Start accepts. Automaton has 15564 states and 46981 transitions. Word has length 66 [2019-12-18 16:22:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:45,938 INFO L462 AbstractCegarLoop]: Abstraction has 15564 states and 46981 transitions. [2019-12-18 16:22:45,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 16:22:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 15564 states and 46981 transitions. [2019-12-18 16:22:45,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:45,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:45,955 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:45,955 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:45,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1169670237, now seen corresponding path program 1 times [2019-12-18 16:22:45,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:45,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684316657] [2019-12-18 16:22:45,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:46,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684316657] [2019-12-18 16:22:46,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:46,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 16:22:46,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465200769] [2019-12-18 16:22:46,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 16:22:46,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:46,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 16:22:46,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-18 16:22:46,120 INFO L87 Difference]: Start difference. First operand 15564 states and 46981 transitions. Second operand 10 states. [2019-12-18 16:22:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:47,843 INFO L93 Difference]: Finished difference Result 30007 states and 90225 transitions. [2019-12-18 16:22:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 16:22:47,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 16:22:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:47,875 INFO L225 Difference]: With dead ends: 30007 [2019-12-18 16:22:47,875 INFO L226 Difference]: Without dead ends: 22904 [2019-12-18 16:22:47,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-18 16:22:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22904 states. [2019-12-18 16:22:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22904 to 16133. [2019-12-18 16:22:48,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-18 16:22:48,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48466 transitions. [2019-12-18 16:22:48,150 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48466 transitions. Word has length 67 [2019-12-18 16:22:48,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:48,150 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48466 transitions. [2019-12-18 16:22:48,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 16:22:48,151 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48466 transitions. [2019-12-18 16:22:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:48,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:48,165 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:48,166 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:48,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1087519045, now seen corresponding path program 2 times [2019-12-18 16:22:48,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:48,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329220915] [2019-12-18 16:22:48,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:48,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329220915] [2019-12-18 16:22:48,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:48,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:22:48,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984432270] [2019-12-18 16:22:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:22:48,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:22:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:22:48,329 INFO L87 Difference]: Start difference. First operand 16133 states and 48466 transitions. Second operand 11 states. [2019-12-18 16:22:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:50,189 INFO L93 Difference]: Finished difference Result 27912 states and 83194 transitions. [2019-12-18 16:22:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 16:22:50,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:22:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:50,220 INFO L225 Difference]: With dead ends: 27912 [2019-12-18 16:22:50,220 INFO L226 Difference]: Without dead ends: 23354 [2019-12-18 16:22:50,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-18 16:22:50,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23354 states. [2019-12-18 16:22:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23354 to 16151. [2019-12-18 16:22:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16151 states. [2019-12-18 16:22:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16151 states to 16151 states and 48315 transitions. [2019-12-18 16:22:50,494 INFO L78 Accepts]: Start accepts. Automaton has 16151 states and 48315 transitions. Word has length 67 [2019-12-18 16:22:50,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:50,494 INFO L462 AbstractCegarLoop]: Abstraction has 16151 states and 48315 transitions. [2019-12-18 16:22:50,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:22:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 16151 states and 48315 transitions. [2019-12-18 16:22:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:50,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:50,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:50,509 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:50,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:50,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1951872541, now seen corresponding path program 3 times [2019-12-18 16:22:50,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:50,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248629271] [2019-12-18 16:22:50,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:50,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248629271] [2019-12-18 16:22:50,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:50,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:22:50,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567740545] [2019-12-18 16:22:50,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:22:50,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:22:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:22:50,711 INFO L87 Difference]: Start difference. First operand 16151 states and 48315 transitions. Second operand 11 states. [2019-12-18 16:22:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:51,814 INFO L93 Difference]: Finished difference Result 35539 states and 106271 transitions. [2019-12-18 16:22:51,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 16:22:51,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:22:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:51,858 INFO L225 Difference]: With dead ends: 35539 [2019-12-18 16:22:51,858 INFO L226 Difference]: Without dead ends: 32894 [2019-12-18 16:22:51,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 16:22:51,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32894 states. [2019-12-18 16:22:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32894 to 18499. [2019-12-18 16:22:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18499 states. [2019-12-18 16:22:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18499 states to 18499 states and 54947 transitions. [2019-12-18 16:22:52,232 INFO L78 Accepts]: Start accepts. Automaton has 18499 states and 54947 transitions. Word has length 67 [2019-12-18 16:22:52,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:52,232 INFO L462 AbstractCegarLoop]: Abstraction has 18499 states and 54947 transitions. [2019-12-18 16:22:52,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:22:52,232 INFO L276 IsEmpty]: Start isEmpty. Operand 18499 states and 54947 transitions. [2019-12-18 16:22:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:52,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:52,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:52,249 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1574036275, now seen corresponding path program 4 times [2019-12-18 16:22:52,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:52,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810000299] [2019-12-18 16:22:52,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:52,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810000299] [2019-12-18 16:22:52,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:52,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 16:22:52,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318628190] [2019-12-18 16:22:52,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 16:22:52,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 16:22:52,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 16:22:52,427 INFO L87 Difference]: Start difference. First operand 18499 states and 54947 transitions. Second operand 11 states. [2019-12-18 16:22:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:53,502 INFO L93 Difference]: Finished difference Result 33413 states and 98987 transitions. [2019-12-18 16:22:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:22:53,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 16:22:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:53,542 INFO L225 Difference]: With dead ends: 33413 [2019-12-18 16:22:53,542 INFO L226 Difference]: Without dead ends: 27387 [2019-12-18 16:22:53,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 16:22:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27387 states. [2019-12-18 16:22:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27387 to 15072. [2019-12-18 16:22:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15072 states. [2019-12-18 16:22:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15072 states to 15072 states and 45088 transitions. [2019-12-18 16:22:53,843 INFO L78 Accepts]: Start accepts. Automaton has 15072 states and 45088 transitions. Word has length 67 [2019-12-18 16:22:53,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:53,843 INFO L462 AbstractCegarLoop]: Abstraction has 15072 states and 45088 transitions. [2019-12-18 16:22:53,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 16:22:53,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15072 states and 45088 transitions. [2019-12-18 16:22:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:53,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:53,857 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:53,857 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:53,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:53,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1709159453, now seen corresponding path program 5 times [2019-12-18 16:22:53,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:53,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905266547] [2019-12-18 16:22:53,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 16:22:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 16:22:54,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905266547] [2019-12-18 16:22:54,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 16:22:54,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 16:22:54,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440397964] [2019-12-18 16:22:54,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 16:22:54,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 16:22:54,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 16:22:54,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 16:22:54,026 INFO L87 Difference]: Start difference. First operand 15072 states and 45088 transitions. Second operand 12 states. [2019-12-18 16:22:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 16:22:54,920 INFO L93 Difference]: Finished difference Result 27346 states and 81899 transitions. [2019-12-18 16:22:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 16:22:54,921 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-18 16:22:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 16:22:54,956 INFO L225 Difference]: With dead ends: 27346 [2019-12-18 16:22:54,957 INFO L226 Difference]: Without dead ends: 26919 [2019-12-18 16:22:54,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 16:22:55,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26919 states. [2019-12-18 16:22:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26919 to 14812. [2019-12-18 16:22:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14812 states. [2019-12-18 16:22:55,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 44426 transitions. [2019-12-18 16:22:55,480 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 44426 transitions. Word has length 67 [2019-12-18 16:22:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 16:22:55,481 INFO L462 AbstractCegarLoop]: Abstraction has 14812 states and 44426 transitions. [2019-12-18 16:22:55,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 16:22:55,481 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 44426 transitions. [2019-12-18 16:22:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 16:22:55,494 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 16:22:55,494 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 16:22:55,495 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 16:22:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 16:22:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 656134515, now seen corresponding path program 6 times [2019-12-18 16:22:55,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 16:22:55,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634295020] [2019-12-18 16:22:55,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 16:22:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:22:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 16:22:55,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 16:22:55,602 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 16:22:55,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= v_~a$r_buff1_thd0~0_203 0) (= 0 v_~a$r_buff1_thd1~0_191) (= v_~z~0_36 0) (= 0 |v_ULTIMATE.start_main_~#t281~0.offset_26|) (= v_~a$r_buff0_thd0~0_228 0) (= 0 v_~a$r_buff0_thd1~0_317) (= 0 v_~a$read_delayed_var~0.base_8) (= 0 v_~a$r_buff0_thd2~0_205) (= v_~main$tmp_guard1~0_42 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t281~0.base_37|) (= v_~a$r_buff0_thd3~0_430 0) (= v_~main$tmp_guard0~0_25 0) (= 0 v_~__unbuffered_p2_EAX~0_47) (= (select .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37|) 0) (= v_~__unbuffered_cnt~0_111 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x~0_176) (= v_~__unbuffered_p1_EBX~0_55 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t281~0.base_37| 4)) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t281~0.base_37| 1)) (= 0 |v_#NULL.base_4|) (= v_~a$mem_tmp~0_16 0) (= 0 v_~a$w_buff0_used~0_889) (= v_~a$w_buff0~0_416 0) (= v_~a$r_buff1_thd3~0_333 0) (= 0 v_~a$w_buff1_used~0_596) (= |v_#NULL.offset_4| 0) (= 0 v_~a$w_buff1~0_333) (= 0 v_~a$r_buff1_thd2~0_185) (= v_~a~0_191 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~__unbuffered_p2_EBX~0_48 0) (= 0 v_~weak$$choice0~0_13) (= v_~weak$$choice2~0_131 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t281~0.base_37|) |v_ULTIMATE.start_main_~#t281~0.offset_26| 0)) |v_#memory_int_23|) (= v_~y~0_31 0) (= 0 v_~a$read_delayed~0_8) (= v_~a$flush_delayed~0_26 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_38|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_51|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_59|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_228, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_127|, ~a~0=v_~a~0_191, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_83|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_47, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_333, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_889, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_317, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_416, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_203, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, ~x~0=v_~x~0_176, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_67|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~a$w_buff1~0=v_~a$w_buff1~0_333, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_30|, ~y~0=v_~y~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_55, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_191, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_430, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_26|, ULTIMATE.start_main_~#t281~0.base=|v_ULTIMATE.start_main_~#t281~0.base_37|, ~a$flush_delayed~0=v_~a$flush_delayed~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_36, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_596, ~weak$$choice2~0=v_~weak$$choice2~0_131, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t281~0.offset=|v_ULTIMATE.start_main_~#t281~0.offset_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t283~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t283~0.base, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t282~0.offset, ULTIMATE.start_main_~#t281~0.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t281~0.offset] because there is no mapped edge [2019-12-18 16:22:55,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t282~0.base_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t282~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t282~0.base_13|) |v_ULTIMATE.start_main_~#t282~0.offset_11| 1)) |v_#memory_int_15|) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t282~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t282~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t282~0.base_13|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t282~0.base=|v_ULTIMATE.start_main_~#t282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t282~0.offset=|v_ULTIMATE.start_main_~#t282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t282~0.offset] because there is no mapped edge [2019-12-18 16:22:55,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L750: Formula: (and (= v_~a$r_buff0_thd1~0_28 v_~a$r_buff1_thd1~0_23) (= v_~a$r_buff0_thd2~0_20 v_~a$r_buff1_thd2~0_16) (= v_~a$r_buff0_thd0~0_18 v_~a$r_buff1_thd0~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~a$r_buff0_thd1~0_27 1) (= 1 v_~x~0_7) (= v_~a$r_buff0_thd3~0_73 v_~a$r_buff1_thd3~0_40)) InVars {~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_28, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18} OutVars{~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_23, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_40, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_17, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_73, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_27, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_18, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 16:22:55,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In-1321169835 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1321169835 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out-1321169835| ~a$w_buff1~0_In-1321169835) (not .cse1)) (and (= ~a~0_In-1321169835 |P1Thread1of1ForFork2_#t~ite9_Out-1321169835|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1321169835, ~a$w_buff1~0=~a$w_buff1~0_In-1321169835, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1321169835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1321169835} OutVars{~a~0=~a~0_In-1321169835, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1321169835|, ~a$w_buff1~0=~a$w_buff1~0_In-1321169835, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1321169835, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1321169835} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 16:22:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_16| v_~a~0_47) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_16|} OutVars{~a~0=v_~a~0_47, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_15|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 16:22:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1184161856 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In1184161856 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out1184161856| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In1184161856 |P0Thread1of1ForFork1_#t~ite5_Out1184161856|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1184161856, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1184161856} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1184161856|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1184161856, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1184161856} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 16:22:55,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In856013768 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In856013768 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd1~0_In856013768 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In856013768 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out856013768| ~a$w_buff1_used~0_In856013768)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork1_#t~ite6_Out856013768| 0)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In856013768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In856013768, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In856013768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In856013768} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out856013768|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In856013768, ~a$w_buff0_used~0=~a$w_buff0_used~0_In856013768, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In856013768, ~a$w_buff1_used~0=~a$w_buff1_used~0_In856013768} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 16:22:55,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L753-->L754: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1939987187 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-1939987187 256)))) (or (and (not .cse0) (not .cse1) (= ~a$r_buff0_thd1~0_Out-1939987187 0)) (and (= ~a$r_buff0_thd1~0_Out-1939987187 ~a$r_buff0_thd1~0_In-1939987187) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1939987187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1939987187} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1939987187|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1939987187, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1939987187} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 16:22:55,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~a$w_buff1_used~0_In-754307120 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In-754307120 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In-754307120 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-754307120 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-754307120|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~a$r_buff1_thd1~0_In-754307120 |P0Thread1of1ForFork1_#t~ite8_Out-754307120|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-754307120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-754307120, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-754307120, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-754307120} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-754307120|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-754307120, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-754307120, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-754307120, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-754307120} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 16:22:55,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L754-2-->P0EXIT: Formula: (and (= v_~a$r_buff1_thd1~0_148 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_148, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 16:22:55,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L837-1-->L839: Formula: (and (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12|) 0) (= |v_ULTIMATE.start_main_~#t283~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t283~0.base_12| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t283~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t283~0.base_12| 0)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t283~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t283~0.base_12|) |v_ULTIMATE.start_main_~#t283~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t283~0.base=|v_ULTIMATE.start_main_~#t283~0.base_12|, #length=|v_#length_15|, ULTIMATE.start_main_~#t283~0.offset=|v_ULTIMATE.start_main_~#t283~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t283~0.base, #length, ULTIMATE.start_main_~#t283~0.offset] because there is no mapped edge [2019-12-18 16:22:55,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L801-->L801-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In817628387 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out817628387| |P2Thread1of1ForFork0_#t~ite20_Out817628387|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In817628387 256)))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In817628387 256) 0)) (= (mod ~a$w_buff0_used~0_In817628387 256) 0) (and (= (mod ~a$w_buff1_used~0_In817628387 256) 0) .cse1))) (= ~a$w_buff0~0_In817628387 |P2Thread1of1ForFork0_#t~ite20_Out817628387|)) (and (not .cse0) (= ~a$w_buff0~0_In817628387 |P2Thread1of1ForFork0_#t~ite21_Out817628387|) (= |P2Thread1of1ForFork0_#t~ite20_In817628387| |P2Thread1of1ForFork0_#t~ite20_Out817628387|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In817628387, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In817628387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In817628387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In817628387, ~a$w_buff1_used~0=~a$w_buff1_used~0_In817628387, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In817628387|, ~weak$$choice2~0=~weak$$choice2~0_In817628387} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out817628387|, ~a$w_buff0~0=~a$w_buff0~0_In817628387, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In817628387, ~a$w_buff0_used~0=~a$w_buff0_used~0_In817628387, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In817628387, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out817628387|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In817628387, ~weak$$choice2~0=~weak$$choice2~0_In817628387} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 16:22:55,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L803-->L803-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In807066770 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out807066770| |P2Thread1of1ForFork0_#t~ite26_Out807066770|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In807066770 256)))) (or (= (mod ~a$w_buff0_used~0_In807066770 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In807066770 256)) .cse0) (and (= (mod ~a$w_buff1_used~0_In807066770 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out807066770| ~a$w_buff0_used~0_In807066770)) (and (= |P2Thread1of1ForFork0_#t~ite27_Out807066770| ~a$w_buff0_used~0_In807066770) (= |P2Thread1of1ForFork0_#t~ite26_In807066770| |P2Thread1of1ForFork0_#t~ite26_Out807066770|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In807066770|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In807066770, ~a$w_buff0_used~0=~a$w_buff0_used~0_In807066770, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In807066770, ~a$w_buff1_used~0=~a$w_buff1_used~0_In807066770, ~weak$$choice2~0=~weak$$choice2~0_In807066770} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out807066770|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out807066770|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In807066770, ~a$w_buff0_used~0=~a$w_buff0_used~0_In807066770, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In807066770, ~a$w_buff1_used~0=~a$w_buff1_used~0_In807066770, ~weak$$choice2~0=~weak$$choice2~0_In807066770} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 16:22:55,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L804-->L804-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1872581577 256)))) (or (and (= ~a$w_buff1_used~0_In-1872581577 |P2Thread1of1ForFork0_#t~ite29_Out-1872581577|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1872581577| |P2Thread1of1ForFork0_#t~ite30_Out-1872581577|) .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1872581577 256)))) (or (= (mod ~a$w_buff0_used~0_In-1872581577 256) 0) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-1872581577 256) 0)) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1872581577 256) 0))))) (and (= ~a$w_buff1_used~0_In-1872581577 |P2Thread1of1ForFork0_#t~ite30_Out-1872581577|) (= |P2Thread1of1ForFork0_#t~ite29_In-1872581577| |P2Thread1of1ForFork0_#t~ite29_Out-1872581577|) (not .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1872581577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872581577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1872581577, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872581577, ~weak$$choice2~0=~weak$$choice2~0_In-1872581577, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1872581577|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1872581577, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1872581577, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1872581577, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1872581577|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1872581577, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1872581577|, ~weak$$choice2~0=~weak$$choice2~0_In-1872581577} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 16:22:55,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] L805-->L806: Formula: (and (not (= (mod v_~weak$$choice2~0_32 256) 0)) (= v_~a$r_buff0_thd3~0_136 v_~a$r_buff0_thd3~0_135)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_32} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_135, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_12|, ~weak$$choice2~0=v_~weak$$choice2~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 16:22:55,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_12 0) (= v_~a~0_57 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_13 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_13} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~a~0=v_~a~0_57, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 16:22:55,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L812-2-->L812-4: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-944132903 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-944132903 256) 0))) (or (and (or .cse0 .cse1) (= ~a~0_In-944132903 |P2Thread1of1ForFork0_#t~ite38_Out-944132903|)) (and (not .cse1) (= ~a$w_buff1~0_In-944132903 |P2Thread1of1ForFork0_#t~ite38_Out-944132903|) (not .cse0)))) InVars {~a~0=~a~0_In-944132903, ~a$w_buff1~0=~a$w_buff1~0_In-944132903, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-944132903, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-944132903} OutVars{~a~0=~a~0_In-944132903, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-944132903|, ~a$w_buff1~0=~a$w_buff1~0_In-944132903, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-944132903, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-944132903} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:22:55,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L812-4-->L813: Formula: (= v_~a~0_20 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_20, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_13|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 16:22:55,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In950640070 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In950640070 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out950640070| ~a$w_buff0_used~0_In950640070) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out950640070| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In950640070, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In950640070} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out950640070|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In950640070, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In950640070} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 16:22:55,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1149227264 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1149227264 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1149227264 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1149227264 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1149227264| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-1149227264| ~a$w_buff1_used~0_In-1149227264)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1149227264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1149227264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1149227264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1149227264} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1149227264, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1149227264, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1149227264, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1149227264, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1149227264|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 16:22:55,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1438155138 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1438155138 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1438155138| ~a$r_buff0_thd3~0_In-1438155138) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1438155138| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1438155138, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1438155138} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1438155138, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1438155138, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1438155138|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 16:22:55,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In-695874889 256) 0)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-695874889 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-695874889 256))) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-695874889 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In-695874889 |P2Thread1of1ForFork0_#t~ite43_Out-695874889|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-695874889| 0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-695874889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-695874889, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-695874889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-695874889} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-695874889|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-695874889, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-695874889, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-695874889, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-695874889} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 16:22:55,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= v_~a$r_buff1_thd3~0_122 |v_P2Thread1of1ForFork0_#t~ite43_34|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_122, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 16:22:55,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1377561849 256))) (.cse1 (= (mod ~a$r_buff0_thd2~0_In-1377561849 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1377561849| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1377561849| ~a$w_buff0_used~0_In-1377561849) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1377561849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1377561849} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1377561849, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1377561849, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1377561849|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 16:22:55,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In-1382499478 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1382499478 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1382499478 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-1382499478 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1382499478| ~a$w_buff1_used~0_In-1382499478) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1382499478|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1382499478, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1382499478, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1382499478, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1382499478} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1382499478, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1382499478, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1382499478, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1382499478|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1382499478} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 16:22:55,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-991801077 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In-991801077 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-991801077|) (not .cse0) (not .cse1)) (and (= ~a$r_buff0_thd2~0_In-991801077 |P1Thread1of1ForFork2_#t~ite13_Out-991801077|) (or .cse1 .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-991801077, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-991801077} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-991801077, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-991801077, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-991801077|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 16:22:55,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L780-->L780-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1302531355 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd2~0_In1302531355 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In1302531355 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1302531355 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1302531355|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd2~0_In1302531355 |P1Thread1of1ForFork2_#t~ite14_Out1302531355|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1302531355, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1302531355, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1302531355, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1302531355} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1302531355, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1302531355, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1302531355, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1302531355, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1302531355|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 16:22:55,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L780-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_24| v_~a$r_buff1_thd2~0_79) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_24|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_79, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_23|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 16:22:55,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 16:22:55,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L845-2-->L845-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In164849930 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In164849930 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out164849930| ~a$w_buff1~0_In164849930) (not .cse1)) (and (= ~a~0_In164849930 |ULTIMATE.start_main_#t~ite47_Out164849930|) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In164849930, ~a$w_buff1~0=~a$w_buff1~0_In164849930, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In164849930, ~a$w_buff1_used~0=~a$w_buff1_used~0_In164849930} OutVars{~a~0=~a~0_In164849930, ~a$w_buff1~0=~a$w_buff1~0_In164849930, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out164849930|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In164849930, ~a$w_buff1_used~0=~a$w_buff1_used~0_In164849930} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 16:22:55,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L845-4-->L846: Formula: (= v_~a~0_30 |v_ULTIMATE.start_main_#t~ite47_13|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|} OutVars{~a~0=v_~a~0_30, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_16|} AuxVars[] AssignedVars[~a~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 16:22:55,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1320854584 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1320854584 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-1320854584|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-1320854584 |ULTIMATE.start_main_#t~ite49_Out-1320854584|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1320854584, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1320854584} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-1320854584, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1320854584|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1320854584} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 16:22:55,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In719200686 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In719200686 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In719200686 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In719200686 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite50_Out719200686| ~a$w_buff1_used~0_In719200686) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite50_Out719200686| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In719200686, ~a$w_buff0_used~0=~a$w_buff0_used~0_In719200686, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In719200686, ~a$w_buff1_used~0=~a$w_buff1_used~0_In719200686} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out719200686|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In719200686, ~a$w_buff0_used~0=~a$w_buff0_used~0_In719200686, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In719200686, ~a$w_buff1_used~0=~a$w_buff1_used~0_In719200686} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 16:22:55,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L848-->L848-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-266026638 256))) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-266026638 256) 0))) (or (and (= ~a$r_buff0_thd0~0_In-266026638 |ULTIMATE.start_main_#t~ite51_Out-266026638|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-266026638| 0) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-266026638, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-266026638} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-266026638|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-266026638, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-266026638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 16:22:55,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1154867218 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-1154867218 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In-1154867218 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd0~0_In-1154867218 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd0~0_In-1154867218 |ULTIMATE.start_main_#t~ite52_Out-1154867218|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-1154867218|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1154867218, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1154867218, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1154867218, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1154867218} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1154867218|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-1154867218, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1154867218, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1154867218, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1154867218} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 16:22:55,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_~main$tmp_guard1~0_18 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= v_~a$r_buff1_thd0~0_158 |v_ULTIMATE.start_main_#t~ite52_40|) (= 2 v_~x~0_125) (= v_~__unbuffered_p1_EBX~0_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_18 256)) (= v_~__unbuffered_p2_EBX~0_24 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_158, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_125, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 16:22:55,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 04:22:55 BasicIcfg [2019-12-18 16:22:55,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 16:22:55,737 INFO L168 Benchmark]: Toolchain (without parser) took 113721.40 ms. Allocated memory was 146.3 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,737 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,738 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.51 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 156.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,742 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,742 INFO L168 Benchmark]: RCFGBuilder took 867.21 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 100.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,743 INFO L168 Benchmark]: TraceAbstraction took 111994.18 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-18 16:22:55,747 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 748.51 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.3 MB in the beginning and 156.4 MB in the end (delta: -54.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.07 ms. Allocated memory is still 202.9 MB. Free memory was 156.4 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.43 ms. Allocated memory is still 202.9 MB. Free memory was 153.2 MB in the beginning and 151.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.21 ms. Allocated memory is still 202.9 MB. Free memory was 151.2 MB in the beginning and 100.4 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 111994.18 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.4 GB). Free memory was 100.4 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7568 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 97 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 90866 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L764] 2 x = 2 [L767] 2 y = 1 [L770] 2 __unbuffered_p1_EAX = y [L773] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L839] FCALL, FORK 0 pthread_create(&t283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L790] 3 z = 1 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=2, y=1, z=1] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L812] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L845] 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 111.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8406 SDtfs, 11798 SDslu, 31498 SDs, 0 SdLazy, 15699 SolverSat, 525 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 58 SyntacticMatches, 19 SemanticMatches, 382 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162755occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 379128 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1638 NumberOfCodeBlocks, 1638 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1540 ConstructedInterpolants, 0 QuantifiedInterpolants, 344216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...