/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/mix042_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:26:37,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:26:37,572 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:26:37,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:26:37,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:26:37,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:26:37,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:26:37,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:26:37,590 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:26:37,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:26:37,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:26:37,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:26:37,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:26:37,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:26:37,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:26:37,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:26:37,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:26:37,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:26:37,599 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:26:37,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:26:37,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:26:37,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:26:37,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:26:37,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:26:37,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:26:37,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:26:37,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:26:37,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:26:37,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:26:37,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:26:37,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:26:37,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:26:37,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:26:37,613 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:26:37,614 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:26:37,614 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:26:37,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:26:37,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:26:37,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:26:37,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:26:37,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:26:37,617 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 17:26:37,632 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:26:37,632 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:26:37,633 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:26:37,634 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:26:37,634 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:26:37,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:26:37,634 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:26:37,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:26:37,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:26:37,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:26:37,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:26:37,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:26:37,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:26:37,636 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:26:37,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:26:37,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:26:37,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:26:37,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:26:37,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:26:37,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:26:37,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:26:37,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:26:37,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:26:37,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:26:37,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:26:37,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:26:37,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:26:37,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:26:37,639 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:26:37,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:26:37,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:26:37,918 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:26:37,919 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:26:37,920 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:26:37,921 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 17:26:37,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8518315/1bd590bc802148958f5c1f3728f42ebc/FLAG0b49296ce [2019-12-18 17:26:38,555 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:26:38,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.oepc.i [2019-12-18 17:26:38,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8518315/1bd590bc802148958f5c1f3728f42ebc/FLAG0b49296ce [2019-12-18 17:26:38,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a8518315/1bd590bc802148958f5c1f3728f42ebc [2019-12-18 17:26:38,897 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:26:38,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:26:38,900 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:38,900 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:26:38,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:26:38,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:38" (1/1) ... [2019-12-18 17:26:38,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5245d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:38, skipping insertion in model container [2019-12-18 17:26:38,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:26:38" (1/1) ... [2019-12-18 17:26:38,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:26:38,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:26:39,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:39,506 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:26:39,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:26:39,656 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:26:39,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39 WrapperNode [2019-12-18 17:26:39,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:26:39,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:39,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:26:39,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:26:39,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:26:39,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:26:39,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:26:39,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:26:39,742 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (1/1) ... [2019-12-18 17:26:39,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:26:39,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:26:39,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:26:39,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:26:39,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (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 17:26:39,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:26:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:26:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:26:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:26:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:26:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:26:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:26:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:26:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:26:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:26:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:26:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:26:39,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:26:39,850 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 17:26:40,625 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:26:40,626 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:26:40,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:40 BoogieIcfgContainer [2019-12-18 17:26:40,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:26:40,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:26:40,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:26:40,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:26:40,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:26:38" (1/3) ... [2019-12-18 17:26:40,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2032ccbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:40, skipping insertion in model container [2019-12-18 17:26:40,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:26:39" (2/3) ... [2019-12-18 17:26:40,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2032ccbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:26:40, skipping insertion in model container [2019-12-18 17:26:40,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:26:40" (3/3) ... [2019-12-18 17:26:40,636 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_power.oepc.i [2019-12-18 17:26:40,647 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:26:40,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:26:40,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:26:40,657 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:26:40,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,709 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,723 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,724 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,758 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,758 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,781 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,805 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,806 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,806 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,807 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,808 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,809 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,818 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,822 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:26:40,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:26:40,860 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:26:40,861 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:26:40,861 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:26:40,861 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:26:40,861 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:26:40,861 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:26:40,861 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:26:40,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:26:40,877 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 17:26:40,879 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 17:26:40,968 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 17:26:40,968 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:40,990 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:26:41,018 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 17:26:41,065 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 17:26:41,065 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:26:41,074 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 17:26:41,096 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 17:26:41,098 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:26:46,737 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 17:26:46,850 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 17:26:47,181 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 17:26:47,325 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 17:26:47,355 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-18 17:26:47,356 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 17:26:47,360 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-18 17:27:01,055 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-18 17:27:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-18 17:27:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 17:27:01,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:01,063 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 17:27:01,063 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 17:27:01,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:01,069 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-18 17:27:01,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:01,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857351047] [2019-12-18 17:27:01,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:01,283 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 17:27:01,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857351047] [2019-12-18 17:27:01,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:01,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:27:01,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111437179] [2019-12-18 17:27:01,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:01,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:01,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:01,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:01,307 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-18 17:27:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:03,564 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-18 17:27:03,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:03,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 17:27:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:04,134 INFO L225 Difference]: With dead ends: 101544 [2019-12-18 17:27:04,134 INFO L226 Difference]: Without dead ends: 95304 [2019-12-18 17:27:04,136 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 17:27:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-18 17:27:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-18 17:27:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-18 17:27:15,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-18 17:27:15,006 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-18 17:27:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:15,007 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-18 17:27:15,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-18 17:27:15,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 17:27:15,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:15,011 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:15,012 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 17:27:15,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:15,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-18 17:27:15,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:15,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547114486] [2019-12-18 17:27:15,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:15,150 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 17:27:15,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547114486] [2019-12-18 17:27:15,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:15,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:15,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711522279] [2019-12-18 17:27:15,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:15,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:15,154 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-18 17:27:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:20,070 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-18 17:27:20,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:20,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 17:27:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:20,621 INFO L225 Difference]: With dead ends: 152040 [2019-12-18 17:27:20,621 INFO L226 Difference]: Without dead ends: 151991 [2019-12-18 17:27:20,622 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 17:27:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-18 17:27:27,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-18 17:27:27,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-18 17:27:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-18 17:27:28,916 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-18 17:27:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:28,916 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-18 17:27:28,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-18 17:27:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:27:28,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:28,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:28,922 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 17:27:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:28,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-18 17:27:28,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:28,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230343581] [2019-12-18 17:27:28,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:28,977 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 17:27:28,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230343581] [2019-12-18 17:27:28,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:28,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:28,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60649762] [2019-12-18 17:27:28,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:28,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:28,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:28,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:28,980 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-18 17:27:29,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:29,120 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-18 17:27:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:29,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:27:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:29,225 INFO L225 Difference]: With dead ends: 30915 [2019-12-18 17:27:29,225 INFO L226 Difference]: Without dead ends: 30915 [2019-12-18 17:27:29,226 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 17:27:29,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-18 17:27:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-18 17:27:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-18 17:27:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-18 17:27:29,906 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-18 17:27:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:29,906 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-18 17:27:29,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-18 17:27:29,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 17:27:29,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:29,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:27:29,909 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 17:27:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:29,910 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-18 17:27:29,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:29,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301062494] [2019-12-18 17:27:29,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:30,066 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 17:27:30,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301062494] [2019-12-18 17:27:30,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:30,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:27:30,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915678317] [2019-12-18 17:27:30,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:30,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:30,069 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-18 17:27:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:31,815 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-18 17:27:31,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:31,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 17:27:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:31,885 INFO L225 Difference]: With dead ends: 38538 [2019-12-18 17:27:31,885 INFO L226 Difference]: Without dead ends: 38538 [2019-12-18 17:27:31,886 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 17:27:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-18 17:27:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-18 17:27:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-18 17:27:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-18 17:27:32,529 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-18 17:27:32,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:32,530 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-18 17:27:32,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-18 17:27:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 17:27:32,538 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:32,539 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 17:27:32,539 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 17:27:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-18 17:27:32,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:32,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413486656] [2019-12-18 17:27:32,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:32,642 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 17:27:32,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413486656] [2019-12-18 17:27:32,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:32,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:32,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855604680] [2019-12-18 17:27:32,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:32,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:32,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:32,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:32,644 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-18 17:27:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:33,222 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-18 17:27:33,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:33,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 17:27:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:33,288 INFO L225 Difference]: With dead ends: 44779 [2019-12-18 17:27:33,289 INFO L226 Difference]: Without dead ends: 44772 [2019-12-18 17:27:33,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:33,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-18 17:27:34,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-18 17:27:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-18 17:27:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-18 17:27:34,233 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-18 17:27:34,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:34,234 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-18 17:27:34,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-18 17:27:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 17:27:34,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:34,246 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 17:27:34,246 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 17:27:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:34,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-18 17:27:34,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:34,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713701855] [2019-12-18 17:27:34,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:34,312 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 17:27:34,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713701855] [2019-12-18 17:27:34,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:34,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:34,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827596746] [2019-12-18 17:27:34,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:27:34,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:34,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:27:34,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:27:34,314 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 4 states. [2019-12-18 17:27:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:34,375 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-18 17:27:34,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:27:34,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 17:27:34,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:34,393 INFO L225 Difference]: With dead ends: 13768 [2019-12-18 17:27:34,394 INFO L226 Difference]: Without dead ends: 13768 [2019-12-18 17:27:34,394 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 17:27:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-18 17:27:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-18 17:27:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-18 17:27:34,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-18 17:27:34,585 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-18 17:27:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:34,585 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-18 17:27:34,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:27:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-18 17:27:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:27:34,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:34,597 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 17:27:34,597 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 17:27:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-18 17:27:34,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:34,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757398611] [2019-12-18 17:27:34,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:34,646 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 17:27:34,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757398611] [2019-12-18 17:27:34,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:34,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:34,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635635770] [2019-12-18 17:27:34,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:34,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:34,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:34,649 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-18 17:27:34,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:34,736 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-18 17:27:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:34,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:27:34,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:34,761 INFO L225 Difference]: With dead ends: 19309 [2019-12-18 17:27:34,762 INFO L226 Difference]: Without dead ends: 19309 [2019-12-18 17:27:34,762 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 17:27:34,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-18 17:27:34,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-18 17:27:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-18 17:27:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-18 17:27:34,993 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-18 17:27:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:34,993 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-18 17:27:34,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-18 17:27:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:27:35,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:35,002 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 17:27:35,002 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 17:27:35,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-18 17:27:35,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:35,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488523923] [2019-12-18 17:27:35,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:35,055 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 17:27:35,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488523923] [2019-12-18 17:27:35,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:35,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:27:35,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745196482] [2019-12-18 17:27:35,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:35,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:35,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:35,057 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-18 17:27:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:35,139 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-18 17:27:35,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:35,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-18 17:27:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:35,166 INFO L225 Difference]: With dead ends: 21037 [2019-12-18 17:27:35,166 INFO L226 Difference]: Without dead ends: 21037 [2019-12-18 17:27:35,166 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 17:27:35,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-18 17:27:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-18 17:27:35,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-18 17:27:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-18 17:27:35,420 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-18 17:27:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:35,420 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-18 17:27:35,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-18 17:27:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 17:27:35,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:35,431 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 17:27:35,431 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 17:27:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:35,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-18 17:27:35,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:35,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452997422] [2019-12-18 17:27:35,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:35,517 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 17:27:35,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452997422] [2019-12-18 17:27:35,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:35,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:35,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116500755] [2019-12-18 17:27:35,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:35,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:35,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:35,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:35,520 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-18 17:27:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:36,260 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-18 17:27:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:36,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 17:27:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:36,299 INFO L225 Difference]: With dead ends: 29609 [2019-12-18 17:27:36,300 INFO L226 Difference]: Without dead ends: 29609 [2019-12-18 17:27:36,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:36,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-18 17:27:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-18 17:27:36,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-18 17:27:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-18 17:27:36,630 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-18 17:27:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:36,631 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-18 17:27:36,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-18 17:27:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 17:27:36,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:36,644 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] [2019-12-18 17:27:36,644 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 17:27:36,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-18 17:27:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528722059] [2019-12-18 17:27:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:36,732 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 17:27:36,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528722059] [2019-12-18 17:27:36,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:36,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:36,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375516806] [2019-12-18 17:27:36,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:27:36,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:27:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:27:36,735 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-18 17:27:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:37,300 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-18 17:27:37,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:27:37,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 17:27:37,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:37,340 INFO L225 Difference]: With dead ends: 28968 [2019-12-18 17:27:37,340 INFO L226 Difference]: Without dead ends: 28968 [2019-12-18 17:27:37,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:37,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-18 17:27:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-18 17:27:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-18 17:27:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-18 17:27:37,681 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-18 17:27:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:37,681 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-18 17:27:37,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:27:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-18 17:27:37,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:37,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:37,700 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 17:27:37,700 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 17:27:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-18 17:27:37,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:37,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568689749] [2019-12-18 17:27:37,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:37,788 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 17:27:37,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568689749] [2019-12-18 17:27:37,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:37,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:37,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144068305] [2019-12-18 17:27:37,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:37,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:37,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:37,790 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 7 states. [2019-12-18 17:27:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:39,010 INFO L93 Difference]: Finished difference Result 38372 states and 112342 transitions. [2019-12-18 17:27:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:27:39,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 17:27:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:39,063 INFO L225 Difference]: With dead ends: 38372 [2019-12-18 17:27:39,064 INFO L226 Difference]: Without dead ends: 38372 [2019-12-18 17:27:39,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:27:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38372 states. [2019-12-18 17:27:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38372 to 20063. [2019-12-18 17:27:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20063 states. [2019-12-18 17:27:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20063 states to 20063 states and 59759 transitions. [2019-12-18 17:27:39,667 INFO L78 Accepts]: Start accepts. Automaton has 20063 states and 59759 transitions. Word has length 33 [2019-12-18 17:27:39,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:39,667 INFO L462 AbstractCegarLoop]: Abstraction has 20063 states and 59759 transitions. [2019-12-18 17:27:39,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:39,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20063 states and 59759 transitions. [2019-12-18 17:27:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 17:27:39,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:39,686 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 17:27:39,687 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 17:27:39,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:39,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-18 17:27:39,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:39,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617024239] [2019-12-18 17:27:39,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:39,795 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 17:27:39,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617024239] [2019-12-18 17:27:39,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:39,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:27:39,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243879052] [2019-12-18 17:27:39,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:27:39,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:39,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:27:39,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:27:39,797 INFO L87 Difference]: Start difference. First operand 20063 states and 59759 transitions. Second operand 8 states. [2019-12-18 17:27:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:41,479 INFO L93 Difference]: Finished difference Result 45317 states and 131735 transitions. [2019-12-18 17:27:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 17:27:41,480 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 17:27:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:41,538 INFO L225 Difference]: With dead ends: 45317 [2019-12-18 17:27:41,539 INFO L226 Difference]: Without dead ends: 45317 [2019-12-18 17:27:41,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:27:41,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45317 states. [2019-12-18 17:27:41,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45317 to 19503. [2019-12-18 17:27:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19503 states. [2019-12-18 17:27:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19503 states to 19503 states and 58091 transitions. [2019-12-18 17:27:41,987 INFO L78 Accepts]: Start accepts. Automaton has 19503 states and 58091 transitions. Word has length 33 [2019-12-18 17:27:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:41,987 INFO L462 AbstractCegarLoop]: Abstraction has 19503 states and 58091 transitions. [2019-12-18 17:27:41,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:27:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19503 states and 58091 transitions. [2019-12-18 17:27:42,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:42,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:42,003 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] [2019-12-18 17:27:42,003 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 17:27:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-18 17:27:42,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:42,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121311764] [2019-12-18 17:27:42,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:42,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 17:27:42,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121311764] [2019-12-18 17:27:42,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:42,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:42,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865584396] [2019-12-18 17:27:42,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:42,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:42,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:42,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:42,091 INFO L87 Difference]: Start difference. First operand 19503 states and 58091 transitions. Second operand 7 states. [2019-12-18 17:27:43,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:43,394 INFO L93 Difference]: Finished difference Result 34977 states and 102254 transitions. [2019-12-18 17:27:43,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:27:43,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 17:27:43,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:43,445 INFO L225 Difference]: With dead ends: 34977 [2019-12-18 17:27:43,446 INFO L226 Difference]: Without dead ends: 34977 [2019-12-18 17:27:43,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:27:43,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34977 states. [2019-12-18 17:27:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34977 to 18371. [2019-12-18 17:27:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18371 states. [2019-12-18 17:27:44,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18371 states to 18371 states and 54788 transitions. [2019-12-18 17:27:44,035 INFO L78 Accepts]: Start accepts. Automaton has 18371 states and 54788 transitions. Word has length 34 [2019-12-18 17:27:44,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:44,036 INFO L462 AbstractCegarLoop]: Abstraction has 18371 states and 54788 transitions. [2019-12-18 17:27:44,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 18371 states and 54788 transitions. [2019-12-18 17:27:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:44,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:44,052 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] [2019-12-18 17:27:44,053 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 17:27:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-18 17:27:44,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:44,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636006819] [2019-12-18 17:27:44,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:44,221 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 17:27:44,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636006819] [2019-12-18 17:27:44,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:44,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:27:44,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854321347] [2019-12-18 17:27:44,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:27:44,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:27:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:44,223 INFO L87 Difference]: Start difference. First operand 18371 states and 54788 transitions. Second operand 9 states. [2019-12-18 17:27:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:45,941 INFO L93 Difference]: Finished difference Result 43257 states and 125033 transitions. [2019-12-18 17:27:45,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 17:27:45,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 17:27:45,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:46,040 INFO L225 Difference]: With dead ends: 43257 [2019-12-18 17:27:46,041 INFO L226 Difference]: Without dead ends: 43257 [2019-12-18 17:27:46,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:27:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43257 states. [2019-12-18 17:27:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43257 to 17826. [2019-12-18 17:27:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-12-18 17:27:46,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 53180 transitions. [2019-12-18 17:27:46,902 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 53180 transitions. Word has length 34 [2019-12-18 17:27:46,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:46,903 INFO L462 AbstractCegarLoop]: Abstraction has 17826 states and 53180 transitions. [2019-12-18 17:27:46,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:27:46,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 53180 transitions. [2019-12-18 17:27:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 17:27:46,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:46,933 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] [2019-12-18 17:27:46,933 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 17:27:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-18 17:27:46,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:46,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210552172] [2019-12-18 17:27:46,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:47,205 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 17:27:47,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210552172] [2019-12-18 17:27:47,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:47,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:27:47,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996665943] [2019-12-18 17:27:47,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:27:47,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:27:47,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:47,207 INFO L87 Difference]: Start difference. First operand 17826 states and 53180 transitions. Second operand 9 states. [2019-12-18 17:27:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:49,464 INFO L93 Difference]: Finished difference Result 41696 states and 119828 transitions. [2019-12-18 17:27:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 17:27:49,465 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-18 17:27:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:49,544 INFO L225 Difference]: With dead ends: 41696 [2019-12-18 17:27:49,544 INFO L226 Difference]: Without dead ends: 41696 [2019-12-18 17:27:49,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=671, Unknown=0, NotChecked=0, Total=870 [2019-12-18 17:27:49,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41696 states. [2019-12-18 17:27:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41696 to 16673. [2019-12-18 17:27:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16673 states. [2019-12-18 17:27:50,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16673 states to 16673 states and 49752 transitions. [2019-12-18 17:27:50,244 INFO L78 Accepts]: Start accepts. Automaton has 16673 states and 49752 transitions. Word has length 34 [2019-12-18 17:27:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:50,244 INFO L462 AbstractCegarLoop]: Abstraction has 16673 states and 49752 transitions. [2019-12-18 17:27:50,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:27:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 16673 states and 49752 transitions. [2019-12-18 17:27:50,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 17:27:50,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:50,269 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 17:27:50,269 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 17:27:50,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:50,269 INFO L82 PathProgramCache]: Analyzing trace with hash -273721601, now seen corresponding path program 1 times [2019-12-18 17:27:50,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:50,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262113279] [2019-12-18 17:27:50,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:50,331 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 17:27:50,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262113279] [2019-12-18 17:27:50,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:50,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:27:50,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161899296] [2019-12-18 17:27:50,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:27:50,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:50,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:27:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:27:50,333 INFO L87 Difference]: Start difference. First operand 16673 states and 49752 transitions. Second operand 3 states. [2019-12-18 17:27:50,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:50,400 INFO L93 Difference]: Finished difference Result 16672 states and 49750 transitions. [2019-12-18 17:27:50,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:27:50,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 17:27:50,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:50,437 INFO L225 Difference]: With dead ends: 16672 [2019-12-18 17:27:50,437 INFO L226 Difference]: Without dead ends: 16672 [2019-12-18 17:27:50,438 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 17:27:50,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-12-18 17:27:50,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16672. [2019-12-18 17:27:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16672 states. [2019-12-18 17:27:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16672 states to 16672 states and 49750 transitions. [2019-12-18 17:27:50,802 INFO L78 Accepts]: Start accepts. Automaton has 16672 states and 49750 transitions. Word has length 39 [2019-12-18 17:27:50,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:50,802 INFO L462 AbstractCegarLoop]: Abstraction has 16672 states and 49750 transitions. [2019-12-18 17:27:50,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:27:50,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16672 states and 49750 transitions. [2019-12-18 17:27:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:27:50,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:50,826 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 17:27:50,826 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 17:27:50,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1365979560, now seen corresponding path program 1 times [2019-12-18 17:27:50,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:50,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963289429] [2019-12-18 17:27:50,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:50,899 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 17:27:50,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963289429] [2019-12-18 17:27:50,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:50,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:27:50,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393550635] [2019-12-18 17:27:50,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:50,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:50,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:50,901 INFO L87 Difference]: Start difference. First operand 16672 states and 49750 transitions. Second operand 5 states. [2019-12-18 17:27:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:51,589 INFO L93 Difference]: Finished difference Result 27362 states and 80459 transitions. [2019-12-18 17:27:51,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:27:51,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:27:51,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:51,643 INFO L225 Difference]: With dead ends: 27362 [2019-12-18 17:27:51,643 INFO L226 Difference]: Without dead ends: 27362 [2019-12-18 17:27:51,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:51,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27362 states. [2019-12-18 17:27:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27362 to 21734. [2019-12-18 17:27:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21734 states. [2019-12-18 17:27:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21734 states to 21734 states and 64728 transitions. [2019-12-18 17:27:51,994 INFO L78 Accepts]: Start accepts. Automaton has 21734 states and 64728 transitions. Word has length 40 [2019-12-18 17:27:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:51,994 INFO L462 AbstractCegarLoop]: Abstraction has 21734 states and 64728 transitions. [2019-12-18 17:27:51,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 21734 states and 64728 transitions. [2019-12-18 17:27:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 17:27:52,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:52,023 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 17:27:52,023 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 17:27:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 2 times [2019-12-18 17:27:52,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:52,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092984424] [2019-12-18 17:27:52,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:52,068 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 17:27:52,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092984424] [2019-12-18 17:27:52,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:52,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:27:52,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121963684] [2019-12-18 17:27:52,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:27:52,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:52,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:27:52,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:27:52,071 INFO L87 Difference]: Start difference. First operand 21734 states and 64728 transitions. Second operand 5 states. [2019-12-18 17:27:52,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:52,180 INFO L93 Difference]: Finished difference Result 20430 states and 61764 transitions. [2019-12-18 17:27:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:27:52,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 17:27:52,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:52,215 INFO L225 Difference]: With dead ends: 20430 [2019-12-18 17:27:52,215 INFO L226 Difference]: Without dead ends: 20430 [2019-12-18 17:27:52,215 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 17:27:52,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20430 states. [2019-12-18 17:27:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20430 to 19562. [2019-12-18 17:27:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19562 states. [2019-12-18 17:27:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19562 states to 19562 states and 59424 transitions. [2019-12-18 17:27:52,516 INFO L78 Accepts]: Start accepts. Automaton has 19562 states and 59424 transitions. Word has length 40 [2019-12-18 17:27:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:52,516 INFO L462 AbstractCegarLoop]: Abstraction has 19562 states and 59424 transitions. [2019-12-18 17:27:52,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:27:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 19562 states and 59424 transitions. [2019-12-18 17:27:52,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:27:52,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:52,538 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 17:27:52,538 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 17:27:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:52,538 INFO L82 PathProgramCache]: Analyzing trace with hash -628796059, now seen corresponding path program 1 times [2019-12-18 17:27:52,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:52,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586948252] [2019-12-18 17:27:52,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:52,667 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 17:27:52,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586948252] [2019-12-18 17:27:52,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:52,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:27:52,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326596653] [2019-12-18 17:27:52,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:27:52,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:52,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:27:52,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:27:52,670 INFO L87 Difference]: Start difference. First operand 19562 states and 59424 transitions. Second operand 8 states. [2019-12-18 17:27:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:54,095 INFO L93 Difference]: Finished difference Result 91773 states and 275275 transitions. [2019-12-18 17:27:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:27:54,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:27:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:54,230 INFO L225 Difference]: With dead ends: 91773 [2019-12-18 17:27:54,230 INFO L226 Difference]: Without dead ends: 65597 [2019-12-18 17:27:54,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 17:27:54,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65597 states. [2019-12-18 17:27:54,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65597 to 23373. [2019-12-18 17:27:54,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23373 states. [2019-12-18 17:27:54,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23373 states to 23373 states and 71220 transitions. [2019-12-18 17:27:54,980 INFO L78 Accepts]: Start accepts. Automaton has 23373 states and 71220 transitions. Word has length 64 [2019-12-18 17:27:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:54,981 INFO L462 AbstractCegarLoop]: Abstraction has 23373 states and 71220 transitions. [2019-12-18 17:27:54,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:27:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 23373 states and 71220 transitions. [2019-12-18 17:27:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:27:55,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:55,007 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 17:27:55,007 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 17:27:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash 637274751, now seen corresponding path program 2 times [2019-12-18 17:27:55,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:55,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504955688] [2019-12-18 17:27:55,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:55,086 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 17:27:55,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504955688] [2019-12-18 17:27:55,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:55,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:27:55,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146847275] [2019-12-18 17:27:55,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:27:55,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:27:55,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:27:55,089 INFO L87 Difference]: Start difference. First operand 23373 states and 71220 transitions. Second operand 7 states. [2019-12-18 17:27:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:55,682 INFO L93 Difference]: Finished difference Result 62216 states and 186100 transitions. [2019-12-18 17:27:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:27:55,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:27:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:55,747 INFO L225 Difference]: With dead ends: 62216 [2019-12-18 17:27:55,747 INFO L226 Difference]: Without dead ends: 45804 [2019-12-18 17:27:55,747 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 17:27:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45804 states. [2019-12-18 17:27:56,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45804 to 27436. [2019-12-18 17:27:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27436 states. [2019-12-18 17:27:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27436 states to 27436 states and 83052 transitions. [2019-12-18 17:27:56,306 INFO L78 Accepts]: Start accepts. Automaton has 27436 states and 83052 transitions. Word has length 64 [2019-12-18 17:27:56,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:56,306 INFO L462 AbstractCegarLoop]: Abstraction has 27436 states and 83052 transitions. [2019-12-18 17:27:56,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:27:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 27436 states and 83052 transitions. [2019-12-18 17:27:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:27:56,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:56,334 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 17:27:56,335 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 17:27:56,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 3 times [2019-12-18 17:27:56,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:56,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555585709] [2019-12-18 17:27:56,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:56,453 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 17:27:56,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555585709] [2019-12-18 17:27:56,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:27:56,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859044238] [2019-12-18 17:27:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:27:56,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:56,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:27:56,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:56,455 INFO L87 Difference]: Start difference. First operand 27436 states and 83052 transitions. Second operand 9 states. [2019-12-18 17:27:56,657 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-12-18 17:27:58,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:27:58,042 INFO L93 Difference]: Finished difference Result 113274 states and 335950 transitions. [2019-12-18 17:27:58,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:27:58,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:27:58,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:27:58,210 INFO L225 Difference]: With dead ends: 113274 [2019-12-18 17:27:58,211 INFO L226 Difference]: Without dead ends: 108630 [2019-12-18 17:27:58,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:27:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108630 states. [2019-12-18 17:27:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108630 to 27989. [2019-12-18 17:27:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27989 states. [2019-12-18 17:27:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27989 states to 27989 states and 84776 transitions. [2019-12-18 17:27:59,251 INFO L78 Accepts]: Start accepts. Automaton has 27989 states and 84776 transitions. Word has length 64 [2019-12-18 17:27:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:27:59,252 INFO L462 AbstractCegarLoop]: Abstraction has 27989 states and 84776 transitions. [2019-12-18 17:27:59,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:27:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 27989 states and 84776 transitions. [2019-12-18 17:27:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:27:59,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:27:59,284 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 17:27:59,284 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 17:27:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:27:59,285 INFO L82 PathProgramCache]: Analyzing trace with hash -972318627, now seen corresponding path program 4 times [2019-12-18 17:27:59,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:27:59,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747891566] [2019-12-18 17:27:59,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:27:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:27:59,395 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 17:27:59,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747891566] [2019-12-18 17:27:59,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:27:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:27:59,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304528962] [2019-12-18 17:27:59,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:27:59,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:27:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:27:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:27:59,402 INFO L87 Difference]: Start difference. First operand 27989 states and 84776 transitions. Second operand 9 states. [2019-12-18 17:28:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:01,357 INFO L93 Difference]: Finished difference Result 91424 states and 271569 transitions. [2019-12-18 17:28:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:28:01,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 17:28:01,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:01,475 INFO L225 Difference]: With dead ends: 91424 [2019-12-18 17:28:01,476 INFO L226 Difference]: Without dead ends: 87972 [2019-12-18 17:28:01,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:28:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87972 states. [2019-12-18 17:28:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87972 to 27789. [2019-12-18 17:28:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27789 states. [2019-12-18 17:28:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27789 states to 27789 states and 84305 transitions. [2019-12-18 17:28:02,356 INFO L78 Accepts]: Start accepts. Automaton has 27789 states and 84305 transitions. Word has length 64 [2019-12-18 17:28:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:02,356 INFO L462 AbstractCegarLoop]: Abstraction has 27789 states and 84305 transitions. [2019-12-18 17:28:02,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:28:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27789 states and 84305 transitions. [2019-12-18 17:28:02,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:28:02,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:02,384 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 17:28:02,385 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 17:28:02,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:02,385 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 5 times [2019-12-18 17:28:02,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:02,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091197290] [2019-12-18 17:28:02,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:02,462 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 17:28:02,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091197290] [2019-12-18 17:28:02,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:02,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:28:02,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973262694] [2019-12-18 17:28:02,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:28:02,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:28:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:28:02,464 INFO L87 Difference]: Start difference. First operand 27789 states and 84305 transitions. Second operand 7 states. [2019-12-18 17:28:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:02,900 INFO L93 Difference]: Finished difference Result 58989 states and 175462 transitions. [2019-12-18 17:28:02,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:28:02,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:28:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:02,972 INFO L225 Difference]: With dead ends: 58989 [2019-12-18 17:28:02,973 INFO L226 Difference]: Without dead ends: 49515 [2019-12-18 17:28:02,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 17:28:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49515 states. [2019-12-18 17:28:03,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49515 to 28125. [2019-12-18 17:28:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28125 states. [2019-12-18 17:28:03,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28125 states to 28125 states and 85287 transitions. [2019-12-18 17:28:03,566 INFO L78 Accepts]: Start accepts. Automaton has 28125 states and 85287 transitions. Word has length 64 [2019-12-18 17:28:03,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:03,566 INFO L462 AbstractCegarLoop]: Abstraction has 28125 states and 85287 transitions. [2019-12-18 17:28:03,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:28:03,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28125 states and 85287 transitions. [2019-12-18 17:28:03,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:28:03,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:03,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, 1, 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 17:28:03,596 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 17:28:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:03,596 INFO L82 PathProgramCache]: Analyzing trace with hash -520581691, now seen corresponding path program 6 times [2019-12-18 17:28:03,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:03,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184001878] [2019-12-18 17:28:03,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:03,715 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 17:28:03,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184001878] [2019-12-18 17:28:03,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:03,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:28:03,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633325874] [2019-12-18 17:28:03,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:28:03,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:28:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:28:03,717 INFO L87 Difference]: Start difference. First operand 28125 states and 85287 transitions. Second operand 7 states. [2019-12-18 17:28:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:05,310 INFO L93 Difference]: Finished difference Result 52488 states and 157602 transitions. [2019-12-18 17:28:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:28:05,310 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 17:28:05,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:05,387 INFO L225 Difference]: With dead ends: 52488 [2019-12-18 17:28:05,388 INFO L226 Difference]: Without dead ends: 52488 [2019-12-18 17:28:05,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:28:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52488 states. [2019-12-18 17:28:05,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52488 to 28461. [2019-12-18 17:28:05,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28461 states. [2019-12-18 17:28:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28461 states to 28461 states and 86415 transitions. [2019-12-18 17:28:06,027 INFO L78 Accepts]: Start accepts. Automaton has 28461 states and 86415 transitions. Word has length 64 [2019-12-18 17:28:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:06,028 INFO L462 AbstractCegarLoop]: Abstraction has 28461 states and 86415 transitions. [2019-12-18 17:28:06,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:28:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 28461 states and 86415 transitions. [2019-12-18 17:28:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:28:06,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:06,063 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 17:28:06,063 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 17:28:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 7 times [2019-12-18 17:28:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:06,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433297620] [2019-12-18 17:28:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:06,198 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 17:28:06,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433297620] [2019-12-18 17:28:06,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:06,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:28:06,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510608711] [2019-12-18 17:28:06,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:28:06,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:06,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:28:06,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:28:06,201 INFO L87 Difference]: Start difference. First operand 28461 states and 86415 transitions. Second operand 8 states. [2019-12-18 17:28:08,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:08,085 INFO L93 Difference]: Finished difference Result 56163 states and 169173 transitions. [2019-12-18 17:28:08,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 17:28:08,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-18 17:28:08,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:08,173 INFO L225 Difference]: With dead ends: 56163 [2019-12-18 17:28:08,173 INFO L226 Difference]: Without dead ends: 56163 [2019-12-18 17:28:08,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-18 17:28:08,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56163 states. [2019-12-18 17:28:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56163 to 28489. [2019-12-18 17:28:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28489 states. [2019-12-18 17:28:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28489 states to 28489 states and 86495 transitions. [2019-12-18 17:28:09,158 INFO L78 Accepts]: Start accepts. Automaton has 28489 states and 86495 transitions. Word has length 64 [2019-12-18 17:28:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:09,158 INFO L462 AbstractCegarLoop]: Abstraction has 28489 states and 86495 transitions. [2019-12-18 17:28:09,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:28:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28489 states and 86495 transitions. [2019-12-18 17:28:09,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 17:28:09,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:09,190 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 17:28:09,190 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 17:28:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2090754765, now seen corresponding path program 8 times [2019-12-18 17:28:09,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:09,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134458378] [2019-12-18 17:28:09,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:09,260 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 17:28:09,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134458378] [2019-12-18 17:28:09,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:09,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:09,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52997971] [2019-12-18 17:28:09,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:09,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:09,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:09,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:09,263 INFO L87 Difference]: Start difference. First operand 28489 states and 86495 transitions. Second operand 3 states. [2019-12-18 17:28:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:09,426 INFO L93 Difference]: Finished difference Result 32830 states and 99680 transitions. [2019-12-18 17:28:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:09,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 17:28:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:09,469 INFO L225 Difference]: With dead ends: 32830 [2019-12-18 17:28:09,470 INFO L226 Difference]: Without dead ends: 32830 [2019-12-18 17:28:09,470 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 17:28:09,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32830 states. [2019-12-18 17:28:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32830 to 28660. [2019-12-18 17:28:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28660 states. [2019-12-18 17:28:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28660 states to 28660 states and 87373 transitions. [2019-12-18 17:28:09,965 INFO L78 Accepts]: Start accepts. Automaton has 28660 states and 87373 transitions. Word has length 64 [2019-12-18 17:28:09,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:09,965 INFO L462 AbstractCegarLoop]: Abstraction has 28660 states and 87373 transitions. [2019-12-18 17:28:09,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 28660 states and 87373 transitions. [2019-12-18 17:28:10,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:10,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:10,002 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 17:28:10,002 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 17:28:10,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:10,002 INFO L82 PathProgramCache]: Analyzing trace with hash 984956460, now seen corresponding path program 1 times [2019-12-18 17:28:10,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:10,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127019269] [2019-12-18 17:28:10,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:10,071 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 17:28:10,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127019269] [2019-12-18 17:28:10,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:10,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:10,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361760425] [2019-12-18 17:28:10,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:10,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:10,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:10,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:10,073 INFO L87 Difference]: Start difference. First operand 28660 states and 87373 transitions. Second operand 4 states. [2019-12-18 17:28:10,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:10,452 INFO L93 Difference]: Finished difference Result 36066 states and 109337 transitions. [2019-12-18 17:28:10,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:28:10,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 17:28:10,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:10,526 INFO L225 Difference]: With dead ends: 36066 [2019-12-18 17:28:10,526 INFO L226 Difference]: Without dead ends: 36066 [2019-12-18 17:28:10,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 17:28:10,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36066 states. [2019-12-18 17:28:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36066 to 29485. [2019-12-18 17:28:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29485 states. [2019-12-18 17:28:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29485 states to 29485 states and 89840 transitions. [2019-12-18 17:28:11,134 INFO L78 Accepts]: Start accepts. Automaton has 29485 states and 89840 transitions. Word has length 65 [2019-12-18 17:28:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:11,134 INFO L462 AbstractCegarLoop]: Abstraction has 29485 states and 89840 transitions. [2019-12-18 17:28:11,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 29485 states and 89840 transitions. [2019-12-18 17:28:11,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:11,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:11,163 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 17:28:11,164 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 17:28:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1689403746, now seen corresponding path program 1 times [2019-12-18 17:28:11,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:11,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400872464] [2019-12-18 17:28:11,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:11,272 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 17:28:11,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400872464] [2019-12-18 17:28:11,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:11,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:28:11,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457315741] [2019-12-18 17:28:11,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:28:11,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:11,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:28:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:28:11,273 INFO L87 Difference]: Start difference. First operand 29485 states and 89840 transitions. Second operand 8 states. [2019-12-18 17:28:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:12,246 INFO L93 Difference]: Finished difference Result 80928 states and 242282 transitions. [2019-12-18 17:28:12,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 17:28:12,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 17:28:12,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:12,344 INFO L225 Difference]: With dead ends: 80928 [2019-12-18 17:28:12,344 INFO L226 Difference]: Without dead ends: 74194 [2019-12-18 17:28:12,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2019-12-18 17:28:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74194 states. [2019-12-18 17:28:13,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74194 to 29951. [2019-12-18 17:28:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29951 states. [2019-12-18 17:28:13,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29951 states to 29951 states and 91468 transitions. [2019-12-18 17:28:13,420 INFO L78 Accepts]: Start accepts. Automaton has 29951 states and 91468 transitions. Word has length 65 [2019-12-18 17:28:13,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:13,420 INFO L462 AbstractCegarLoop]: Abstraction has 29951 states and 91468 transitions. [2019-12-18 17:28:13,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:28:13,420 INFO L276 IsEmpty]: Start isEmpty. Operand 29951 states and 91468 transitions. [2019-12-18 17:28:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:13,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:13,451 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 17:28:13,452 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 17:28:13,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 2 times [2019-12-18 17:28:13,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:13,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592817203] [2019-12-18 17:28:13,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:13,501 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 17:28:13,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592817203] [2019-12-18 17:28:13,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:13,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:28:13,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154009693] [2019-12-18 17:28:13,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:13,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:13,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:13,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:13,503 INFO L87 Difference]: Start difference. First operand 29951 states and 91468 transitions. Second operand 4 states. [2019-12-18 17:28:13,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:13,964 INFO L93 Difference]: Finished difference Result 45778 states and 140292 transitions. [2019-12-18 17:28:13,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:28:13,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 17:28:13,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:14,060 INFO L225 Difference]: With dead ends: 45778 [2019-12-18 17:28:14,061 INFO L226 Difference]: Without dead ends: 45778 [2019-12-18 17:28:14,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 17:28:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45778 states. [2019-12-18 17:28:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45778 to 31406. [2019-12-18 17:28:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31406 states. [2019-12-18 17:28:14,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31406 states to 31406 states and 96530 transitions. [2019-12-18 17:28:14,695 INFO L78 Accepts]: Start accepts. Automaton has 31406 states and 96530 transitions. Word has length 65 [2019-12-18 17:28:14,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:14,695 INFO L462 AbstractCegarLoop]: Abstraction has 31406 states and 96530 transitions. [2019-12-18 17:28:14,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand 31406 states and 96530 transitions. [2019-12-18 17:28:14,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:14,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:14,732 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 17:28:14,732 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 17:28:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash -476661734, now seen corresponding path program 2 times [2019-12-18 17:28:14,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:14,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356812207] [2019-12-18 17:28:14,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:14,844 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 17:28:14,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356812207] [2019-12-18 17:28:14,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:14,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:28:14,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702988802] [2019-12-18 17:28:14,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:28:14,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:14,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:28:14,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:14,847 INFO L87 Difference]: Start difference. First operand 31406 states and 96530 transitions. Second operand 9 states. [2019-12-18 17:28:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:16,352 INFO L93 Difference]: Finished difference Result 103839 states and 309510 transitions. [2019-12-18 17:28:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 17:28:16,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:28:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:16,854 INFO L225 Difference]: With dead ends: 103839 [2019-12-18 17:28:16,854 INFO L226 Difference]: Without dead ends: 93795 [2019-12-18 17:28:16,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:28:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93795 states. [2019-12-18 17:28:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93795 to 31892. [2019-12-18 17:28:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31892 states. [2019-12-18 17:28:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31892 states to 31892 states and 97205 transitions. [2019-12-18 17:28:17,731 INFO L78 Accepts]: Start accepts. Automaton has 31892 states and 97205 transitions. Word has length 65 [2019-12-18 17:28:17,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:17,731 INFO L462 AbstractCegarLoop]: Abstraction has 31892 states and 97205 transitions. [2019-12-18 17:28:17,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:28:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 31892 states and 97205 transitions. [2019-12-18 17:28:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:17,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:17,764 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 17:28:17,764 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 17:28:17,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:17,765 INFO L82 PathProgramCache]: Analyzing trace with hash -123930860, now seen corresponding path program 3 times [2019-12-18 17:28:17,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:17,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797370191] [2019-12-18 17:28:17,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:17,859 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 17:28:17,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797370191] [2019-12-18 17:28:17,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:17,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:28:17,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396951144] [2019-12-18 17:28:17,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:28:17,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:17,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:28:17,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:28:17,861 INFO L87 Difference]: Start difference. First operand 31892 states and 97205 transitions. Second operand 9 states. [2019-12-18 17:28:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:19,060 INFO L93 Difference]: Finished difference Result 88943 states and 264945 transitions. [2019-12-18 17:28:19,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 17:28:19,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-18 17:28:19,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:19,184 INFO L225 Difference]: With dead ends: 88943 [2019-12-18 17:28:19,184 INFO L226 Difference]: Without dead ends: 84511 [2019-12-18 17:28:19,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-18 17:28:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84511 states. [2019-12-18 17:28:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84511 to 30537. [2019-12-18 17:28:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30537 states. [2019-12-18 17:28:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30537 states to 30537 states and 93428 transitions. [2019-12-18 17:28:20,562 INFO L78 Accepts]: Start accepts. Automaton has 30537 states and 93428 transitions. Word has length 65 [2019-12-18 17:28:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:20,562 INFO L462 AbstractCegarLoop]: Abstraction has 30537 states and 93428 transitions. [2019-12-18 17:28:20,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:28:20,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30537 states and 93428 transitions. [2019-12-18 17:28:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:20,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:20,597 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 17:28:20,597 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 17:28:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 535036274, now seen corresponding path program 4 times [2019-12-18 17:28:20,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:20,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243472893] [2019-12-18 17:28:20,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:20,712 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 17:28:20,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243472893] [2019-12-18 17:28:20,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:20,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:28:20,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047188225] [2019-12-18 17:28:20,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:28:20,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:20,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:28:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:28:20,714 INFO L87 Difference]: Start difference. First operand 30537 states and 93428 transitions. Second operand 7 states. [2019-12-18 17:28:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:22,427 INFO L93 Difference]: Finished difference Result 50821 states and 152143 transitions. [2019-12-18 17:28:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 17:28:22,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 17:28:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:22,495 INFO L225 Difference]: With dead ends: 50821 [2019-12-18 17:28:22,495 INFO L226 Difference]: Without dead ends: 50821 [2019-12-18 17:28:22,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-18 17:28:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50821 states. [2019-12-18 17:28:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50821 to 31006. [2019-12-18 17:28:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31006 states. [2019-12-18 17:28:23,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31006 states to 31006 states and 94726 transitions. [2019-12-18 17:28:23,114 INFO L78 Accepts]: Start accepts. Automaton has 31006 states and 94726 transitions. Word has length 65 [2019-12-18 17:28:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:23,115 INFO L462 AbstractCegarLoop]: Abstraction has 31006 states and 94726 transitions. [2019-12-18 17:28:23,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:28:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 31006 states and 94726 transitions. [2019-12-18 17:28:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:23,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:23,147 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 17:28:23,147 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1794298295, now seen corresponding path program 1 times [2019-12-18 17:28:23,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:23,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553510845] [2019-12-18 17:28:23,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:23,216 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 17:28:23,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553510845] [2019-12-18 17:28:23,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:23,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:28:23,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508217700] [2019-12-18 17:28:23,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:28:23,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:28:23,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:28:23,218 INFO L87 Difference]: Start difference. First operand 31006 states and 94726 transitions. Second operand 5 states. [2019-12-18 17:28:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:23,855 INFO L93 Difference]: Finished difference Result 41644 states and 125022 transitions. [2019-12-18 17:28:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 17:28:23,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 17:28:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:23,913 INFO L225 Difference]: With dead ends: 41644 [2019-12-18 17:28:23,913 INFO L226 Difference]: Without dead ends: 41400 [2019-12-18 17:28:23,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:28:24,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41400 states. [2019-12-18 17:28:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41400 to 37128. [2019-12-18 17:28:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37128 states. [2019-12-18 17:28:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37128 states to 37128 states and 112464 transitions. [2019-12-18 17:28:24,477 INFO L78 Accepts]: Start accepts. Automaton has 37128 states and 112464 transitions. Word has length 65 [2019-12-18 17:28:24,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:24,477 INFO L462 AbstractCegarLoop]: Abstraction has 37128 states and 112464 transitions. [2019-12-18 17:28:24,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:28:24,477 INFO L276 IsEmpty]: Start isEmpty. Operand 37128 states and 112464 transitions. [2019-12-18 17:28:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:24,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:24,908 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 17:28:24,909 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:24,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:24,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-18 17:28:24,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:24,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440004084] [2019-12-18 17:28:24,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:24,972 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 17:28:24,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440004084] [2019-12-18 17:28:24,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:24,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:28:24,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277298177] [2019-12-18 17:28:24,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:28:24,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:28:24,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:28:24,975 INFO L87 Difference]: Start difference. First operand 37128 states and 112464 transitions. Second operand 4 states. [2019-12-18 17:28:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:25,150 INFO L93 Difference]: Finished difference Result 36756 states and 111117 transitions. [2019-12-18 17:28:25,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:28:25,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 17:28:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:25,207 INFO L225 Difference]: With dead ends: 36756 [2019-12-18 17:28:25,207 INFO L226 Difference]: Without dead ends: 36756 [2019-12-18 17:28:25,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:28:25,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36756 states. [2019-12-18 17:28:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36756 to 33005. [2019-12-18 17:28:25,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33005 states. [2019-12-18 17:28:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33005 states to 33005 states and 99014 transitions. [2019-12-18 17:28:25,734 INFO L78 Accepts]: Start accepts. Automaton has 33005 states and 99014 transitions. Word has length 65 [2019-12-18 17:28:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:25,734 INFO L462 AbstractCegarLoop]: Abstraction has 33005 states and 99014 transitions. [2019-12-18 17:28:25,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:28:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33005 states and 99014 transitions. [2019-12-18 17:28:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:25,767 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:25,767 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 17:28:25,768 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1586394449, now seen corresponding path program 2 times [2019-12-18 17:28:25,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:25,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087952062] [2019-12-18 17:28:25,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:25,868 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 17:28:25,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087952062] [2019-12-18 17:28:25,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:25,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 17:28:25,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068144497] [2019-12-18 17:28:25,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 17:28:25,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:25,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 17:28:25,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 17:28:25,869 INFO L87 Difference]: Start difference. First operand 33005 states and 99014 transitions. Second operand 8 states. [2019-12-18 17:28:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:27,888 INFO L93 Difference]: Finished difference Result 61177 states and 181302 transitions. [2019-12-18 17:28:27,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 17:28:27,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 17:28:27,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:27,982 INFO L225 Difference]: With dead ends: 61177 [2019-12-18 17:28:27,982 INFO L226 Difference]: Without dead ends: 61177 [2019-12-18 17:28:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-18 17:28:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61177 states. [2019-12-18 17:28:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61177 to 32322. [2019-12-18 17:28:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32322 states. [2019-12-18 17:28:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32322 states to 32322 states and 96920 transitions. [2019-12-18 17:28:28,725 INFO L78 Accepts]: Start accepts. Automaton has 32322 states and 96920 transitions. Word has length 65 [2019-12-18 17:28:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:28,725 INFO L462 AbstractCegarLoop]: Abstraction has 32322 states and 96920 transitions. [2019-12-18 17:28:28,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 17:28:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 32322 states and 96920 transitions. [2019-12-18 17:28:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 17:28:28,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:28,762 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 17:28:28,762 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:28,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:28,763 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-18 17:28:28,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:28,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442704132] [2019-12-18 17:28:28,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:28,816 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 17:28:28,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442704132] [2019-12-18 17:28:28,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:28,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:28,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379723356] [2019-12-18 17:28:28,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:28,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:28,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:28,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:28,818 INFO L87 Difference]: Start difference. First operand 32322 states and 96920 transitions. Second operand 3 states. [2019-12-18 17:28:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:28,922 INFO L93 Difference]: Finished difference Result 32322 states and 96919 transitions. [2019-12-18 17:28:28,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:28,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 17:28:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:28,965 INFO L225 Difference]: With dead ends: 32322 [2019-12-18 17:28:28,965 INFO L226 Difference]: Without dead ends: 32322 [2019-12-18 17:28:28,965 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 17:28:29,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32322 states. [2019-12-18 17:28:29,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32322 to 24848. [2019-12-18 17:28:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24848 states. [2019-12-18 17:28:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24848 states to 24848 states and 76282 transitions. [2019-12-18 17:28:29,627 INFO L78 Accepts]: Start accepts. Automaton has 24848 states and 76282 transitions. Word has length 65 [2019-12-18 17:28:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:29,627 INFO L462 AbstractCegarLoop]: Abstraction has 24848 states and 76282 transitions. [2019-12-18 17:28:29,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 24848 states and 76282 transitions. [2019-12-18 17:28:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 17:28:29,653 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:29,653 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 17:28:29,653 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-18 17:28:29,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:29,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226424928] [2019-12-18 17:28:29,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:28:29,717 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 17:28:29,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226424928] [2019-12-18 17:28:29,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:28:29,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:28:29,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935583578] [2019-12-18 17:28:29,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:28:29,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:28:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:28:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:28:29,719 INFO L87 Difference]: Start difference. First operand 24848 states and 76282 transitions. Second operand 3 states. [2019-12-18 17:28:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:28:29,806 INFO L93 Difference]: Finished difference Result 19993 states and 60264 transitions. [2019-12-18 17:28:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:28:29,806 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 17:28:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:28:29,841 INFO L225 Difference]: With dead ends: 19993 [2019-12-18 17:28:29,841 INFO L226 Difference]: Without dead ends: 19993 [2019-12-18 17:28:29,841 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 17:28:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19993 states. [2019-12-18 17:28:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19993 to 18183. [2019-12-18 17:28:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18183 states. [2019-12-18 17:28:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18183 states to 18183 states and 54770 transitions. [2019-12-18 17:28:30,107 INFO L78 Accepts]: Start accepts. Automaton has 18183 states and 54770 transitions. Word has length 66 [2019-12-18 17:28:30,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:28:30,107 INFO L462 AbstractCegarLoop]: Abstraction has 18183 states and 54770 transitions. [2019-12-18 17:28:30,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:28:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 18183 states and 54770 transitions. [2019-12-18 17:28:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 17:28:30,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:28:30,125 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 17:28:30,125 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:28:30,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:28:30,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-18 17:28:30,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:28:30,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203718785] [2019-12-18 17:28:30,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:28:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:28:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:28:30,248 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:28:30,248 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:28:30,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 |v_ULTIMATE.start_main_~#t1105~0.offset_34|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1105~0.base_55|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1105~0.base_55|) |v_ULTIMATE.start_main_~#t1105~0.offset_34| 0)) |v_#memory_int_21|) (= v_~a$r_buff0_thd3~0_364 0) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= |v_#valid_91| (store .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_55| 1)) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= 0 |v_#NULL.base_4|) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1105~0.base_55| 4) |v_#length_25|) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1105~0.base_55|) 0) (= v_~x~0_91 0) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_20|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_41|, ULTIMATE.start_main_~#t1105~0.base=|v_ULTIMATE.start_main_~#t1105~0.base_55|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t1105~0.offset=|v_ULTIMATE.start_main_~#t1105~0.offset_34|, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, ~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_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1106~0.base, ULTIMATE.start_main_~#t1105~0.base, ~__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, ULTIMATE.start_main_~#t1105~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t1106~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1107~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~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, ~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] because there is no mapped edge [2019-12-18 17:28:30,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd2~0_Out282178431 ~a$r_buff0_thd2~0_In282178431) (= ~x~0_In282178431 ~__unbuffered_p0_EAX~0_Out282178431) (= ~a$r_buff0_thd1~0_Out282178431 1) (= ~a$r_buff1_thd1~0_Out282178431 ~a$r_buff0_thd1~0_In282178431) (= ~a$r_buff0_thd0~0_In282178431 ~a$r_buff1_thd0~0_Out282178431) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In282178431 0)) (= ~a$r_buff0_thd3~0_In282178431 ~a$r_buff1_thd3~0_Out282178431)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In282178431, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In282178431, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In282178431, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In282178431, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In282178431, ~x~0=~x~0_In282178431} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out282178431, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out282178431, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out282178431, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out282178431, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out282178431, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In282178431, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In282178431, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In282178431, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out282178431, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In282178431, ~x~0=~x~0_In282178431} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~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] because there is no mapped edge [2019-12-18 17:28:30,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9| 1)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1106~0.base_9| 4) |v_#length_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1106~0.base_9|) |v_ULTIMATE.start_main_~#t1106~0.offset_7| 1))) (= |v_ULTIMATE.start_main_~#t1106~0.offset_7| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1106~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1106~0.offset=|v_ULTIMATE.start_main_~#t1106~0.offset_7|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1106~0.base=|v_ULTIMATE.start_main_~#t1106~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1106~0.offset, #length, ULTIMATE.start_main_~#t1106~0.base] because there is no mapped edge [2019-12-18 17:28:30,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1107~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1107~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1107~0.base_9|) |v_ULTIMATE.start_main_~#t1107~0.offset_8| 2))) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1107~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1107~0.offset=|v_ULTIMATE.start_main_~#t1107~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1107~0.base=|v_ULTIMATE.start_main_~#t1107~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1107~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1107~0.base] because there is no mapped edge [2019-12-18 17:28:30,255 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd2~0_In1292004324 256) 0)) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1292004324 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite9_Out1292004324| |P1Thread1of1ForFork2_#t~ite10_Out1292004324|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1292004324| ~a$w_buff1~0_In1292004324) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1292004324| ~a~0_In1292004324) .cse1))) InVars {~a~0=~a~0_In1292004324, ~a$w_buff1~0=~a$w_buff1~0_In1292004324, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1292004324, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1292004324} OutVars{~a~0=~a~0_In1292004324, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1292004324|, ~a$w_buff1~0=~a$w_buff1~0_In1292004324, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1292004324, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1292004324|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1292004324} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 17:28:30,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In935884910 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In935884910 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out935884910| 0)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In935884910 |P1Thread1of1ForFork2_#t~ite11_Out935884910|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In935884910, ~a$w_buff0_used~0=~a$w_buff0_used~0_In935884910} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In935884910, ~a$w_buff0_used~0=~a$w_buff0_used~0_In935884910, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out935884910|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 17:28:30,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In2078939003 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2078939003 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In2078939003 256) 0)) (.cse3 (= (mod ~a$w_buff1_used~0_In2078939003 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff1_used~0_In2078939003 |P1Thread1of1ForFork2_#t~ite12_Out2078939003|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out2078939003| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2078939003, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2078939003, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2078939003, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2078939003} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2078939003, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2078939003, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2078939003, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out2078939003|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2078939003} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 17:28:30,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1890021918 256)))) (or (and .cse0 (= ~a$w_buff0~0_In-1890021918 |P2Thread1of1ForFork0_#t~ite20_Out-1890021918|) (= |P2Thread1of1ForFork0_#t~ite21_Out-1890021918| |P2Thread1of1ForFork0_#t~ite20_Out-1890021918|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-1890021918 256) 0))) (or (= 0 (mod ~a$w_buff0_used~0_In-1890021918 256)) (and (= (mod ~a$r_buff1_thd3~0_In-1890021918 256) 0) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-1890021918 256) 0))))) (and (not .cse0) (= ~a$w_buff0~0_In-1890021918 |P2Thread1of1ForFork0_#t~ite21_Out-1890021918|) (= |P2Thread1of1ForFork0_#t~ite20_In-1890021918| |P2Thread1of1ForFork0_#t~ite20_Out-1890021918|)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-1890021918, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1890021918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1890021918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1890021918, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1890021918, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-1890021918|, ~weak$$choice2~0=~weak$$choice2~0_In-1890021918} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-1890021918|, ~a$w_buff0~0=~a$w_buff0~0_In-1890021918, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1890021918, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1890021918, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1890021918, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-1890021918|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1890021918, ~weak$$choice2~0=~weak$$choice2~0_In-1890021918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 17:28:30,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1742531083 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd2~0_In1742531083 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In1742531083 |P1Thread1of1ForFork2_#t~ite13_Out1742531083|)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1742531083| 0) (not .cse1) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742531083, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742531083} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1742531083, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1742531083, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1742531083|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 17:28:30,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd2~0_In215551533 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In215551533 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In215551533 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In215551533 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out215551533| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out215551533| ~a$r_buff1_thd2~0_In215551533) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In215551533, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In215551533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In215551533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In215551533} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In215551533, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In215551533, ~a$w_buff0_used~0=~a$w_buff0_used~0_In215551533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In215551533, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out215551533|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 17:28:30,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, 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 17:28:30,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In88065846 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out88065846| ~a$w_buff1~0_In88065846) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In88065846| |P2Thread1of1ForFork0_#t~ite23_Out88065846|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out88065846| |P2Thread1of1ForFork0_#t~ite23_Out88065846|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In88065846 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In88065846 256)) (and .cse1 (= (mod ~a$w_buff1_used~0_In88065846 256) 0)) (and (= (mod ~a$r_buff1_thd3~0_In88065846 256) 0) .cse1))) .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out88065846| ~a$w_buff1~0_In88065846)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In88065846, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In88065846|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In88065846, ~a$w_buff0_used~0=~a$w_buff0_used~0_In88065846, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In88065846, ~a$w_buff1_used~0=~a$w_buff1_used~0_In88065846, ~weak$$choice2~0=~weak$$choice2~0_In88065846} OutVars{~a$w_buff1~0=~a$w_buff1~0_In88065846, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out88065846|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out88065846|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In88065846, ~a$w_buff0_used~0=~a$w_buff0_used~0_In88065846, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In88065846, ~a$w_buff1_used~0=~a$w_buff1_used~0_In88065846, ~weak$$choice2~0=~weak$$choice2~0_In88065846} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 17:28:30,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1196767240 256)))) (or (and .cse0 (= ~a$w_buff0_used~0_In1196767240 |P2Thread1of1ForFork0_#t~ite26_Out1196767240|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In1196767240 256) 0))) (or (and (= (mod ~a$w_buff1_used~0_In1196767240 256) 0) .cse1) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In1196767240 256))) (= 0 (mod ~a$w_buff0_used~0_In1196767240 256)))) (= |P2Thread1of1ForFork0_#t~ite27_Out1196767240| |P2Thread1of1ForFork0_#t~ite26_Out1196767240|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1196767240| |P2Thread1of1ForFork0_#t~ite26_Out1196767240|) (= |P2Thread1of1ForFork0_#t~ite27_Out1196767240| ~a$w_buff0_used~0_In1196767240)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1196767240|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1196767240, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1196767240, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1196767240, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1196767240, ~weak$$choice2~0=~weak$$choice2~0_In1196767240} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1196767240|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1196767240|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1196767240, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1196767240, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1196767240, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1196767240, ~weak$$choice2~0=~weak$$choice2~0_In1196767240} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 17:28:30,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} 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 17:28:30,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-18 17:28:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff1_thd3~0_In-762711743 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-762711743 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-762711743| ~a$w_buff1~0_In-762711743) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-762711743| ~a~0_In-762711743) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-762711743, ~a$w_buff1~0=~a$w_buff1~0_In-762711743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-762711743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762711743} OutVars{~a~0=~a~0_In-762711743, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-762711743|, ~a$w_buff1~0=~a$w_buff1~0_In-762711743, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-762711743, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-762711743} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:28:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 17:28:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-2126009900 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-2126009900 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2126009900 |P2Thread1of1ForFork0_#t~ite40_Out-2126009900|)) (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2126009900|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2126009900, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2126009900} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2126009900|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2126009900, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2126009900} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 17:28:30,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In86106755 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In86106755 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out86106755| 0) (not .cse1)) (and (= ~a$w_buff0_used~0_In86106755 |P0Thread1of1ForFork1_#t~ite5_Out86106755|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In86106755, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In86106755} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out86106755|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In86106755, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In86106755} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 17:28:30,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1251054974 256))) (.cse0 (= (mod ~a$r_buff1_thd1~0_In-1251054974 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd1~0_In-1251054974 256) 0)) (.cse2 (= (mod ~a$w_buff0_used~0_In-1251054974 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1251054974| ~a$w_buff1_used~0_In-1251054974) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1251054974|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1251054974, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1251054974, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1251054974, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1251054974} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1251054974|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1251054974, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1251054974, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1251054974, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1251054974} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 17:28:30,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1639272090 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1639272090 256)))) (or (and (= ~a$r_buff0_thd1~0_Out1639272090 ~a$r_buff0_thd1~0_In1639272090) (or .cse0 .cse1)) (and (= ~a$r_buff0_thd1~0_Out1639272090 0) (not .cse1) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1639272090, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1639272090} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1639272090|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1639272090, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1639272090} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 17:28:30,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-362530678 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-362530678 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-362530678 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-362530678 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-362530678| ~a$r_buff1_thd1~0_In-362530678) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-362530678|)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-362530678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-362530678, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-362530678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-362530678} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-362530678|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-362530678, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-362530678, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-362530678, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-362530678} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 17:28:30,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} 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 17:28:30,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In-1888700759 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In-1888700759 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-1888700759 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-1888700759 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-1888700759| ~a$w_buff1_used~0_In-1888700759) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1888700759|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1888700759, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1888700759, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1888700759, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1888700759} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1888700759, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1888700759, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1888700759, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1888700759, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1888700759|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 17:28:30,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In582078313 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In582078313 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out582078313| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out582078313| ~a$r_buff0_thd3~0_In582078313) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In582078313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In582078313} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In582078313, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In582078313, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out582078313|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 17:28:30,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1503385541 256))) (.cse2 (= (mod ~a$r_buff0_thd3~0_In-1503385541 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1503385541 256))) (.cse1 (= (mod ~a$r_buff1_thd3~0_In-1503385541 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1503385541|)) (and (or .cse3 .cse2) (= ~a$r_buff1_thd3~0_In-1503385541 |P2Thread1of1ForFork0_#t~ite43_Out-1503385541|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503385541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503385541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1503385541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503385541} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1503385541|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1503385541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1503385541, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1503385541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1503385541} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 17:28:30,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, 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 17:28:30,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:28:30,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1074079114 256))) (.cse2 (= (mod ~a$r_buff1_thd0~0_In1074079114 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite47_Out1074079114| |ULTIMATE.start_main_#t~ite48_Out1074079114|))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1074079114| ~a~0_In1074079114) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) .cse0 (= ~a$w_buff1~0_In1074079114 |ULTIMATE.start_main_#t~ite47_Out1074079114|)))) InVars {~a~0=~a~0_In1074079114, ~a$w_buff1~0=~a$w_buff1~0_In1074079114, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1074079114, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1074079114} OutVars{~a~0=~a~0_In1074079114, ~a$w_buff1~0=~a$w_buff1~0_In1074079114, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1074079114|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1074079114, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1074079114|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1074079114} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 17:28:30,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In-62370306 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-62370306 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-62370306|)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-62370306| ~a$w_buff0_used~0_In-62370306)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-62370306, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-62370306} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-62370306, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-62370306|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-62370306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 17:28:30,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-2133126102 256))) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-2133126102 256) 0)) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In-2133126102 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-2133126102 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite50_Out-2133126102| ~a$w_buff1_used~0_In-2133126102)) (and (= |ULTIMATE.start_main_#t~ite50_Out-2133126102| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2133126102, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2133126102, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2133126102, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2133126102} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2133126102|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2133126102, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2133126102, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2133126102, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2133126102} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 17:28:30,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1316828604 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In1316828604 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out1316828604|) (not .cse1)) (and (= ~a$r_buff0_thd0~0_In1316828604 |ULTIMATE.start_main_#t~ite51_Out1316828604|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1316828604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1316828604} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1316828604|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1316828604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1316828604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 17:28:30,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd0~0_In362694674 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In362694674 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In362694674 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In362694674 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out362694674| 0)) (and (= |ULTIMATE.start_main_#t~ite52_Out362694674| ~a$r_buff1_thd0~0_In362694674) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In362694674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In362694674, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In362694674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In362694674} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out362694674|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In362694674, ~a$w_buff0_used~0=~a$w_buff0_used~0_In362694674, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In362694674, ~a$w_buff1_used~0=~a$w_buff1_used~0_In362694674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 17:28:30,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} 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 17:28:30,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:28:30 BasicIcfg [2019-12-18 17:28:30,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:28:30,372 INFO L168 Benchmark]: Toolchain (without parser) took 111474.63 ms. Allocated memory was 145.2 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 100.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,373 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 757.10 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,373 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.12 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,374 INFO L168 Benchmark]: Boogie Preprocessor took 45.18 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,374 INFO L168 Benchmark]: RCFGBuilder took 849.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,374 INFO L168 Benchmark]: TraceAbstraction took 109742.36 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 958.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:28:30,376 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.78 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 757.10 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 156.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.12 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.18 ms. Allocated memory is still 203.4 MB. Free memory was 154.0 MB in the beginning and 151.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 849.36 ms. Allocated memory is still 203.4 MB. Free memory was 151.3 MB in the beginning and 101.3 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109742.36 ms. Allocated memory was 203.4 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 958.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0] [L768] EXPR 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_p0_EAX=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=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 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=0, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 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) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 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)) [L770] 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 [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 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)) [L798] 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)) [L799] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, 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))=0, x=1, y=2, z=1] [L799] 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)) [L801] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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=8, 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=1, y=2, z=1] [L801] 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)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 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) [L807] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 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 [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 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 [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 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_p0_EAX=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=1, 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=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 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 [L843] 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, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.3s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 43.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9366 SDtfs, 13814 SDslu, 26244 SDs, 0 SdLazy, 17119 SolverSat, 792 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 540 GetRequests, 121 SyntacticMatches, 20 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred 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: 40.8s AutomataMinimizationTime, 37 MinimizatonAttempts, 704760 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1781 NumberOfCodeBlocks, 1781 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 302857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...