/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:45:11,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:45:11,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:45:11,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:45:11,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:45:11,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:45:11,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:45:11,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:45:11,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:45:11,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:45:11,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:45:11,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:45:11,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:45:11,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:45:11,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:45:11,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:45:11,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:45:11,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:45:11,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:45:11,517 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:45:11,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:45:11,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:45:11,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:45:11,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:45:11,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:45:11,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:45:11,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:45:11,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:45:11,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:45:11,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:45:11,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:45:11,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:45:11,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:45:11,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:45:11,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:45:11,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:45:11,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:45:11,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:45:11,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:45:11,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:45:11,542 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:45:11,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:45:11,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:45:11,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:45:11,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:45:11,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:45:11,569 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:45:11,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:45:11,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:45:11,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:45:11,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:45:11,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:45:11,570 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:45:11,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:45:11,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:45:11,571 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:45:11,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:45:11,571 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:45:11,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:45:11,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:45:11,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:45:11,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:45:11,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:45:11,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:45:11,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:45:11,573 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:45:11,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:45:11,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:45:11,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:45:11,884 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:45:11,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:45:11,886 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:45:11,887 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-26 22:45:11,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41d4ff54/75de6cc3110543fea6d35447513b37a6/FLAGcdfafbf22 [2019-12-26 22:45:12,510 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:45:12,511 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_pso.opt.i [2019-12-26 22:45:12,526 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41d4ff54/75de6cc3110543fea6d35447513b37a6/FLAGcdfafbf22 [2019-12-26 22:45:12,773 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41d4ff54/75de6cc3110543fea6d35447513b37a6 [2019-12-26 22:45:12,784 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:45:12,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:45:12,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:45:12,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:45:12,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:45:12,792 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:45:12" (1/1) ... [2019-12-26 22:45:12,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be7c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:12, skipping insertion in model container [2019-12-26 22:45:12,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:45:12" (1/1) ... [2019-12-26 22:45:12,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:45:12,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:45:13,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:45:13,448 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:45:13,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:45:13,582 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:45:13,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13 WrapperNode [2019-12-26 22:45:13,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:45:13,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:45:13,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:45:13,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:45:13,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,617 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,663 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:45:13,664 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:45:13,664 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:45:13,664 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:45:13,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (1/1) ... [2019-12-26 22:45:13,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:45:13,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:45:13,711 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:45:13,711 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:45:13,712 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (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-26 22:45:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:45:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:45:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:45:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:45:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:45:13,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:45:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:45:13,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:45:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:45:13,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:45:13,785 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:45:13,785 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:45:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:45:13,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:45:13,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:45:13,788 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:45:14,529 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:45:14,529 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:45:14,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:45:14 BoogieIcfgContainer [2019-12-26 22:45:14,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:45:14,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:45:14,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:45:14,536 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:45:14,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:45:12" (1/3) ... [2019-12-26 22:45:14,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a26bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:45:14, skipping insertion in model container [2019-12-26 22:45:14,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:45:13" (2/3) ... [2019-12-26 22:45:14,538 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a26bdfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:45:14, skipping insertion in model container [2019-12-26 22:45:14,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:45:14" (3/3) ... [2019-12-26 22:45:14,540 INFO L109 eAbstractionObserver]: Analyzing ICFG mix047_pso.opt.i [2019-12-26 22:45:14,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:45:14,551 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:45:14,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:45:14,559 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:45:14,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,597 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,599 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,599 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,601 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,608 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,609 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,609 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,609 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,610 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,610 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,614 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,615 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,616 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,639 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,649 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,651 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:45:14,667 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:45:14,684 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:45:14,684 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:45:14,684 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:45:14,684 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:45:14,685 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:45:14,685 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:45:14,685 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:45:14,685 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:45:14,704 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-26 22:45:14,706 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:45:14,823 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:45:14,824 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:45:14,843 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:45:14,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-26 22:45:14,937 INFO L132 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-26 22:45:14,937 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:45:14,944 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 267 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:45:14,959 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:45:14,960 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:45:20,124 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-26 22:45:20,279 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-26 22:45:20,340 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49999 [2019-12-26 22:45:20,341 INFO L214 etLargeBlockEncoding]: Total number of compositions: 122 [2019-12-26 22:45:20,345 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 95 transitions [2019-12-26 22:45:22,583 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34566 states. [2019-12-26 22:45:22,585 INFO L276 IsEmpty]: Start isEmpty. Operand 34566 states. [2019-12-26 22:45:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:45:22,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:22,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:22,594 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1471654446, now seen corresponding path program 1 times [2019-12-26 22:45:22,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:22,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102356626] [2019-12-26 22:45:22,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:22,971 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-26 22:45:22,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102356626] [2019-12-26 22:45:22,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:22,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:45:22,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892581203] [2019-12-26 22:45:22,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:22,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:22,994 INFO L87 Difference]: Start difference. First operand 34566 states. Second operand 3 states. [2019-12-26 22:45:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:24,629 INFO L93 Difference]: Finished difference Result 34366 states and 145616 transitions. [2019-12-26 22:45:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:24,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:45:24,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:25,015 INFO L225 Difference]: With dead ends: 34366 [2019-12-26 22:45:25,015 INFO L226 Difference]: Without dead ends: 33638 [2019-12-26 22:45:25,017 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-26 22:45:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33638 states. [2019-12-26 22:45:26,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33638 to 33638. [2019-12-26 22:45:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33638 states. [2019-12-26 22:45:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33638 states to 33638 states and 142648 transitions. [2019-12-26 22:45:28,383 INFO L78 Accepts]: Start accepts. Automaton has 33638 states and 142648 transitions. Word has length 9 [2019-12-26 22:45:28,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:28,385 INFO L462 AbstractCegarLoop]: Abstraction has 33638 states and 142648 transitions. [2019-12-26 22:45:28,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:45:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 33638 states and 142648 transitions. [2019-12-26 22:45:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:45:28,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:28,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:28,398 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:28,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1198985017, now seen corresponding path program 1 times [2019-12-26 22:45:28,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:28,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679610967] [2019-12-26 22:45:28,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:28,534 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-26 22:45:28,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679610967] [2019-12-26 22:45:28,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:28,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:45:28,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339886423] [2019-12-26 22:45:28,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:45:28,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:28,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:45:28,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:45:28,538 INFO L87 Difference]: Start difference. First operand 33638 states and 142648 transitions. Second operand 4 states. [2019-12-26 22:45:29,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:29,482 INFO L93 Difference]: Finished difference Result 52350 states and 214824 transitions. [2019-12-26 22:45:29,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:45:29,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:45:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:29,750 INFO L225 Difference]: With dead ends: 52350 [2019-12-26 22:45:29,750 INFO L226 Difference]: Without dead ends: 52322 [2019-12-26 22:45:29,751 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-26 22:45:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52322 states. [2019-12-26 22:45:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52322 to 47746. [2019-12-26 22:45:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47746 states. [2019-12-26 22:45:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47746 states to 47746 states and 197744 transitions. [2019-12-26 22:45:32,384 INFO L78 Accepts]: Start accepts. Automaton has 47746 states and 197744 transitions. Word has length 15 [2019-12-26 22:45:32,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:32,384 INFO L462 AbstractCegarLoop]: Abstraction has 47746 states and 197744 transitions. [2019-12-26 22:45:32,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:45:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47746 states and 197744 transitions. [2019-12-26 22:45:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:45:32,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:32,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:32,388 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash -633584, now seen corresponding path program 1 times [2019-12-26 22:45:32,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:32,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601276965] [2019-12-26 22:45:32,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:32,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:45:32,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601276965] [2019-12-26 22:45:32,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:32,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:45:32,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186657852] [2019-12-26 22:45:32,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:32,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:32,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:32,427 INFO L87 Difference]: Start difference. First operand 47746 states and 197744 transitions. Second operand 3 states. [2019-12-26 22:45:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:32,643 INFO L93 Difference]: Finished difference Result 37462 states and 143322 transitions. [2019-12-26 22:45:32,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:32,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 22:45:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:32,738 INFO L225 Difference]: With dead ends: 37462 [2019-12-26 22:45:32,738 INFO L226 Difference]: Without dead ends: 37462 [2019-12-26 22:45:32,738 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-26 22:45:35,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37462 states. [2019-12-26 22:45:35,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37462 to 37462. [2019-12-26 22:45:35,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37462 states. [2019-12-26 22:45:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37462 states to 37462 states and 143322 transitions. [2019-12-26 22:45:36,139 INFO L78 Accepts]: Start accepts. Automaton has 37462 states and 143322 transitions. Word has length 15 [2019-12-26 22:45:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:36,140 INFO L462 AbstractCegarLoop]: Abstraction has 37462 states and 143322 transitions. [2019-12-26 22:45:36,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:45:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 37462 states and 143322 transitions. [2019-12-26 22:45:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:45:36,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:36,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:36,143 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -375525237, now seen corresponding path program 1 times [2019-12-26 22:45:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:36,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146518824] [2019-12-26 22:45:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:36,187 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-26 22:45:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146518824] [2019-12-26 22:45:36,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:36,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:45:36,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982613967] [2019-12-26 22:45:36,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:45:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:45:36,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:45:36,190 INFO L87 Difference]: Start difference. First operand 37462 states and 143322 transitions. Second operand 4 states. [2019-12-26 22:45:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:36,273 INFO L93 Difference]: Finished difference Result 15610 states and 49514 transitions. [2019-12-26 22:45:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:45:36,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:45:36,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:36,304 INFO L225 Difference]: With dead ends: 15610 [2019-12-26 22:45:36,304 INFO L226 Difference]: Without dead ends: 15610 [2019-12-26 22:45:36,304 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-26 22:45:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15610 states. [2019-12-26 22:45:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15610 to 15610. [2019-12-26 22:45:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15610 states. [2019-12-26 22:45:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15610 states to 15610 states and 49514 transitions. [2019-12-26 22:45:36,627 INFO L78 Accepts]: Start accepts. Automaton has 15610 states and 49514 transitions. Word has length 16 [2019-12-26 22:45:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:36,628 INFO L462 AbstractCegarLoop]: Abstraction has 15610 states and 49514 transitions. [2019-12-26 22:45:36,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:45:36,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15610 states and 49514 transitions. [2019-12-26 22:45:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-26 22:45:36,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:36,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:45:36,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:36,631 INFO L82 PathProgramCache]: Analyzing trace with hash 680326116, now seen corresponding path program 1 times [2019-12-26 22:45:36,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:36,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219142124] [2019-12-26 22:45:36,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:36,704 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-26 22:45:36,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219142124] [2019-12-26 22:45:36,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:36,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:45:36,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455221482] [2019-12-26 22:45:36,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:45:36,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:45:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:45:36,706 INFO L87 Difference]: Start difference. First operand 15610 states and 49514 transitions. Second operand 5 states. [2019-12-26 22:45:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:36,753 INFO L93 Difference]: Finished difference Result 2718 states and 7032 transitions. [2019-12-26 22:45:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:45:36,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-26 22:45:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:36,758 INFO L225 Difference]: With dead ends: 2718 [2019-12-26 22:45:36,758 INFO L226 Difference]: Without dead ends: 2718 [2019-12-26 22:45:36,759 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-26 22:45:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2019-12-26 22:45:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2718. [2019-12-26 22:45:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2718 states. [2019-12-26 22:45:36,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2718 states to 2718 states and 7032 transitions. [2019-12-26 22:45:36,800 INFO L78 Accepts]: Start accepts. Automaton has 2718 states and 7032 transitions. Word has length 17 [2019-12-26 22:45:36,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:36,801 INFO L462 AbstractCegarLoop]: Abstraction has 2718 states and 7032 transitions. [2019-12-26 22:45:36,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:45:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2718 states and 7032 transitions. [2019-12-26 22:45:36,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:45:36,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:36,806 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] [2019-12-26 22:45:36,806 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:36,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:36,807 INFO L82 PathProgramCache]: Analyzing trace with hash 794969432, now seen corresponding path program 1 times [2019-12-26 22:45:36,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:36,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414689975] [2019-12-26 22:45:36,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:36,908 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-26 22:45:36,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414689975] [2019-12-26 22:45:36,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:36,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:45:36,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524227318] [2019-12-26 22:45:36,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:45:36,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:45:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:45:36,910 INFO L87 Difference]: Start difference. First operand 2718 states and 7032 transitions. Second operand 6 states. [2019-12-26 22:45:36,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:36,954 INFO L93 Difference]: Finished difference Result 1354 states and 3884 transitions. [2019-12-26 22:45:36,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:45:36,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:45:36,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:36,957 INFO L225 Difference]: With dead ends: 1354 [2019-12-26 22:45:36,957 INFO L226 Difference]: Without dead ends: 1354 [2019-12-26 22:45:36,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:45:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2019-12-26 22:45:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1214. [2019-12-26 22:45:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-26 22:45:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 3484 transitions. [2019-12-26 22:45:36,974 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 3484 transitions. Word has length 29 [2019-12-26 22:45:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:36,974 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 3484 transitions. [2019-12-26 22:45:36,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:45:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 3484 transitions. [2019-12-26 22:45:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:45:36,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:36,979 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] [2019-12-26 22:45:36,980 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:36,980 INFO L82 PathProgramCache]: Analyzing trace with hash 593702588, now seen corresponding path program 1 times [2019-12-26 22:45:36,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:36,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012337367] [2019-12-26 22:45:36,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:37,108 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-26 22:45:37,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012337367] [2019-12-26 22:45:37,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:37,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:45:37,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506948181] [2019-12-26 22:45:37,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:37,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:37,110 INFO L87 Difference]: Start difference. First operand 1214 states and 3484 transitions. Second operand 3 states. [2019-12-26 22:45:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:37,150 INFO L93 Difference]: Finished difference Result 1222 states and 3492 transitions. [2019-12-26 22:45:37,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:37,151 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:45:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:37,153 INFO L225 Difference]: With dead ends: 1222 [2019-12-26 22:45:37,153 INFO L226 Difference]: Without dead ends: 1222 [2019-12-26 22:45:37,154 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-26 22:45:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-12-26 22:45:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1217. [2019-12-26 22:45:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-26 22:45:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3487 transitions. [2019-12-26 22:45:37,174 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3487 transitions. Word has length 58 [2019-12-26 22:45:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:37,175 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3487 transitions. [2019-12-26 22:45:37,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:45:37,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3487 transitions. [2019-12-26 22:45:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 22:45:37,179 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:37,179 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] [2019-12-26 22:45:37,180 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:37,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1128085639, now seen corresponding path program 1 times [2019-12-26 22:45:37,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:37,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992498510] [2019-12-26 22:45:37,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:37,280 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-26 22:45:37,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992498510] [2019-12-26 22:45:37,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:37,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:45:37,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916586615] [2019-12-26 22:45:37,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:37,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:37,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:37,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:37,283 INFO L87 Difference]: Start difference. First operand 1217 states and 3487 transitions. Second operand 3 states. [2019-12-26 22:45:37,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:37,307 INFO L93 Difference]: Finished difference Result 1165 states and 3279 transitions. [2019-12-26 22:45:37,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:37,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 22:45:37,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:37,310 INFO L225 Difference]: With dead ends: 1165 [2019-12-26 22:45:37,310 INFO L226 Difference]: Without dead ends: 1165 [2019-12-26 22:45:37,310 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-26 22:45:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-12-26 22:45:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2019-12-26 22:45:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2019-12-26 22:45:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 3279 transitions. [2019-12-26 22:45:37,322 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 3279 transitions. Word has length 58 [2019-12-26 22:45:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:37,323 INFO L462 AbstractCegarLoop]: Abstraction has 1165 states and 3279 transitions. [2019-12-26 22:45:37,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:45:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 3279 transitions. [2019-12-26 22:45:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:45:37,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:37,327 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] [2019-12-26 22:45:37,327 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1714711898, now seen corresponding path program 1 times [2019-12-26 22:45:37,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:37,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415434802] [2019-12-26 22:45:37,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:37,437 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-26 22:45:37,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415434802] [2019-12-26 22:45:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:45:37,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708833796] [2019-12-26 22:45:37,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:45:37,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:37,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:45:37,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:45:37,439 INFO L87 Difference]: Start difference. First operand 1165 states and 3279 transitions. Second operand 6 states. [2019-12-26 22:45:38,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:38,017 INFO L93 Difference]: Finished difference Result 1866 states and 5249 transitions. [2019-12-26 22:45:38,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:45:38,018 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:45:38,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:38,022 INFO L225 Difference]: With dead ends: 1866 [2019-12-26 22:45:38,022 INFO L226 Difference]: Without dead ends: 1866 [2019-12-26 22:45:38,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:45:38,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2019-12-26 22:45:38,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1481. [2019-12-26 22:45:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2019-12-26 22:45:38,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 4187 transitions. [2019-12-26 22:45:38,051 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 4187 transitions. Word has length 59 [2019-12-26 22:45:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:38,052 INFO L462 AbstractCegarLoop]: Abstraction has 1481 states and 4187 transitions. [2019-12-26 22:45:38,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:45:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 4187 transitions. [2019-12-26 22:45:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:45:38,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:38,056 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] [2019-12-26 22:45:38,056 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash -240075320, now seen corresponding path program 2 times [2019-12-26 22:45:38,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:38,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281468957] [2019-12-26 22:45:38,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:38,183 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-26 22:45:38,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281468957] [2019-12-26 22:45:38,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:38,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:45:38,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286119562] [2019-12-26 22:45:38,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:45:38,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:45:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:45:38,186 INFO L87 Difference]: Start difference. First operand 1481 states and 4187 transitions. Second operand 6 states. [2019-12-26 22:45:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:38,265 INFO L93 Difference]: Finished difference Result 2115 states and 5649 transitions. [2019-12-26 22:45:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:45:38,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:45:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:38,268 INFO L225 Difference]: With dead ends: 2115 [2019-12-26 22:45:38,268 INFO L226 Difference]: Without dead ends: 1355 [2019-12-26 22:45:38,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:45:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-26 22:45:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1355. [2019-12-26 22:45:38,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-12-26 22:45:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 3763 transitions. [2019-12-26 22:45:38,290 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 3763 transitions. Word has length 59 [2019-12-26 22:45:38,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:38,291 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 3763 transitions. [2019-12-26 22:45:38,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:45:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 3763 transitions. [2019-12-26 22:45:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:45:38,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:38,294 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] [2019-12-26 22:45:38,295 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2057740932, now seen corresponding path program 3 times [2019-12-26 22:45:38,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:38,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274904551] [2019-12-26 22:45:38,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:38,400 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-26 22:45:38,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274904551] [2019-12-26 22:45:38,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:38,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:45:38,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358482002] [2019-12-26 22:45:38,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:45:38,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:38,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:45:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:45:38,403 INFO L87 Difference]: Start difference. First operand 1355 states and 3763 transitions. Second operand 3 states. [2019-12-26 22:45:38,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:38,445 INFO L93 Difference]: Finished difference Result 1355 states and 3762 transitions. [2019-12-26 22:45:38,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:45:38,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:45:38,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:38,449 INFO L225 Difference]: With dead ends: 1355 [2019-12-26 22:45:38,449 INFO L226 Difference]: Without dead ends: 1355 [2019-12-26 22:45:38,450 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-26 22:45:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-12-26 22:45:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 826. [2019-12-26 22:45:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-26 22:45:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2272 transitions. [2019-12-26 22:45:38,467 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2272 transitions. Word has length 59 [2019-12-26 22:45:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:38,468 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 2272 transitions. [2019-12-26 22:45:38,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:45:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2272 transitions. [2019-12-26 22:45:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:38,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:38,470 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] [2019-12-26 22:45:38,470 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1465585068, now seen corresponding path program 1 times [2019-12-26 22:45:38,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:38,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043931379] [2019-12-26 22:45:38,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:38,747 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-26 22:45:38,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043931379] [2019-12-26 22:45:38,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:38,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:45:38,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213391410] [2019-12-26 22:45:38,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:45:38,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:38,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:45:38,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:45:38,750 INFO L87 Difference]: Start difference. First operand 826 states and 2272 transitions. Second operand 6 states. [2019-12-26 22:45:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:38,869 INFO L93 Difference]: Finished difference Result 1418 states and 3614 transitions. [2019-12-26 22:45:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:45:38,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-26 22:45:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:38,872 INFO L225 Difference]: With dead ends: 1418 [2019-12-26 22:45:38,872 INFO L226 Difference]: Without dead ends: 779 [2019-12-26 22:45:38,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:45:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-26 22:45:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 600. [2019-12-26 22:45:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2019-12-26 22:45:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1449 transitions. [2019-12-26 22:45:38,888 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1449 transitions. Word has length 60 [2019-12-26 22:45:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:38,888 INFO L462 AbstractCegarLoop]: Abstraction has 600 states and 1449 transitions. [2019-12-26 22:45:38,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:45:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1449 transitions. [2019-12-26 22:45:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:38,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:38,891 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] [2019-12-26 22:45:38,892 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:38,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -665728346, now seen corresponding path program 2 times [2019-12-26 22:45:38,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:38,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4568462] [2019-12-26 22:45:38,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:39,116 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-26 22:45:39,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4568462] [2019-12-26 22:45:39,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:39,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:45:39,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469767822] [2019-12-26 22:45:39,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:45:39,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:45:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:45:39,120 INFO L87 Difference]: Start difference. First operand 600 states and 1449 transitions. Second operand 5 states. [2019-12-26 22:45:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:39,185 INFO L93 Difference]: Finished difference Result 785 states and 1776 transitions. [2019-12-26 22:45:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:45:39,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2019-12-26 22:45:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:39,186 INFO L225 Difference]: With dead ends: 785 [2019-12-26 22:45:39,187 INFO L226 Difference]: Without dead ends: 232 [2019-12-26 22:45:39,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:45:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-12-26 22:45:39,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2019-12-26 22:45:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-12-26 22:45:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 410 transitions. [2019-12-26 22:45:39,196 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 410 transitions. Word has length 60 [2019-12-26 22:45:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:39,196 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 410 transitions. [2019-12-26 22:45:39,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:45:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 410 transitions. [2019-12-26 22:45:39,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:39,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:39,198 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] [2019-12-26 22:45:39,199 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:39,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:39,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1097199394, now seen corresponding path program 3 times [2019-12-26 22:45:39,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:39,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195760725] [2019-12-26 22:45:39,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:39,581 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-26 22:45:39,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195760725] [2019-12-26 22:45:39,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:39,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:45:39,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969757014] [2019-12-26 22:45:39,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:45:39,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:45:39,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:45:39,584 INFO L87 Difference]: Start difference. First operand 232 states and 410 transitions. Second operand 14 states. [2019-12-26 22:45:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:40,222 INFO L93 Difference]: Finished difference Result 402 states and 693 transitions. [2019-12-26 22:45:40,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:45:40,222 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:45:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:40,223 INFO L225 Difference]: With dead ends: 402 [2019-12-26 22:45:40,223 INFO L226 Difference]: Without dead ends: 374 [2019-12-26 22:45:40,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-26 22:45:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-12-26 22:45:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 328. [2019-12-26 22:45:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-26 22:45:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 574 transitions. [2019-12-26 22:45:40,229 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 574 transitions. Word has length 60 [2019-12-26 22:45:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:40,229 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 574 transitions. [2019-12-26 22:45:40,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:45:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 574 transitions. [2019-12-26 22:45:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:40,230 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:40,231 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] [2019-12-26 22:45:40,231 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1151648330, now seen corresponding path program 4 times [2019-12-26 22:45:40,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:40,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788800620] [2019-12-26 22:45:40,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:40,514 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-26 22:45:40,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788800620] [2019-12-26 22:45:40,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:40,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-26 22:45:40,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348167943] [2019-12-26 22:45:40,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:45:40,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:45:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:45:40,517 INFO L87 Difference]: Start difference. First operand 328 states and 574 transitions. Second operand 13 states. [2019-12-26 22:45:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:41,081 INFO L93 Difference]: Finished difference Result 442 states and 749 transitions. [2019-12-26 22:45:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:45:41,082 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-26 22:45:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:41,083 INFO L225 Difference]: With dead ends: 442 [2019-12-26 22:45:41,083 INFO L226 Difference]: Without dead ends: 414 [2019-12-26 22:45:41,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:45:41,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-26 22:45:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 332. [2019-12-26 22:45:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-26 22:45:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 581 transitions. [2019-12-26 22:45:41,089 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 581 transitions. Word has length 60 [2019-12-26 22:45:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:41,089 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 581 transitions. [2019-12-26 22:45:41,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:45:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 581 transitions. [2019-12-26 22:45:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:41,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:41,090 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] [2019-12-26 22:45:41,091 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2140500766, now seen corresponding path program 5 times [2019-12-26 22:45:41,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:41,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100302417] [2019-12-26 22:45:41,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:41,396 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-26 22:45:41,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100302417] [2019-12-26 22:45:41,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:41,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 22:45:41,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107417909] [2019-12-26 22:45:41,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 22:45:41,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 22:45:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:45:41,399 INFO L87 Difference]: Start difference. First operand 332 states and 581 transitions. Second operand 15 states. [2019-12-26 22:45:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:42,597 INFO L93 Difference]: Finished difference Result 529 states and 897 transitions. [2019-12-26 22:45:42,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:45:42,598 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 60 [2019-12-26 22:45:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:42,599 INFO L225 Difference]: With dead ends: 529 [2019-12-26 22:45:42,599 INFO L226 Difference]: Without dead ends: 501 [2019-12-26 22:45:42,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:45:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2019-12-26 22:45:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 342. [2019-12-26 22:45:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-26 22:45:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 599 transitions. [2019-12-26 22:45:42,605 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 599 transitions. Word has length 60 [2019-12-26 22:45:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:42,605 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 599 transitions. [2019-12-26 22:45:42,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 22:45:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 599 transitions. [2019-12-26 22:45:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:42,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:42,606 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] [2019-12-26 22:45:42,607 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1366424482, now seen corresponding path program 6 times [2019-12-26 22:45:42,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:42,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374814546] [2019-12-26 22:45:42,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:45:42,888 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-26 22:45:42,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374814546] [2019-12-26 22:45:42,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:45:42,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:45:42,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771885523] [2019-12-26 22:45:42,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-26 22:45:42,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:45:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-26 22:45:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:45:42,891 INFO L87 Difference]: Start difference. First operand 342 states and 599 transitions. Second operand 14 states. [2019-12-26 22:45:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:45:43,453 INFO L93 Difference]: Finished difference Result 456 states and 776 transitions. [2019-12-26 22:45:43,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:45:43,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-26 22:45:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:45:43,454 INFO L225 Difference]: With dead ends: 456 [2019-12-26 22:45:43,455 INFO L226 Difference]: Without dead ends: 428 [2019-12-26 22:45:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:45:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-26 22:45:43,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 340. [2019-12-26 22:45:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-26 22:45:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 595 transitions. [2019-12-26 22:45:43,460 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 595 transitions. Word has length 60 [2019-12-26 22:45:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:45:43,461 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 595 transitions. [2019-12-26 22:45:43,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-26 22:45:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 595 transitions. [2019-12-26 22:45:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:45:43,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:45:43,462 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] [2019-12-26 22:45:43,462 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:45:43,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:45:43,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1858118138, now seen corresponding path program 7 times [2019-12-26 22:45:43,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:45:43,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856632186] [2019-12-26 22:45:43,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:45:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:45:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:45:43,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:45:43,587 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:45:43,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~z$flush_delayed~0_54) (= |v_#NULL.offset_7| 0) (= v_~z$w_buff1_used~0_609 0) (= 0 v_~z$r_buff1_thd3~0_278) (= v_~z$w_buff0_used~0_830 0) (= v_~z$r_buff0_thd1~0_77 0) (= v_~x~0_53 0) (< 0 |v_#StackHeapBarrier_21|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21|) 0) (= v_~z$w_buff0~0_376 0) (= 0 |v_ULTIMATE.start_main_~#t1261~0.offset_17|) (= v_~z$r_buff0_thd0~0_415 0) (= v_~z$read_delayed~0_5 0) (= 0 v_~weak$$choice0~0_32) (= v_~z$read_delayed_var~0.base_5 0) (= v_~z$w_buff1~0_367 0) (= v_~weak$$choice2~0_172 0) (= v_~z$r_buff1_thd2~0_207 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1261~0.base_21| 1)) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1261~0.base_21| 4)) (= v_~z$r_buff1_thd1~0_207 0) (= v_~z$read_delayed_var~0.offset_5 0) (= v_~y~0_52 0) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1261~0.base_21|) |v_ULTIMATE.start_main_~#t1261~0.offset_17| 0))) (= 0 v_~z$r_buff1_thd4~0_260) (= v_~z$mem_tmp~0_37 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1261~0.base_21|) (= 0 v_~z$r_buff0_thd3~0_189) (= v_~__unbuffered_cnt~0_145 0) (= 0 |v_#NULL.base_7|) (= v_~main$tmp_guard0~0_21 0) (= v_~z~0_157 0) (= v_~a~0_207 0) (= 0 v_~z$r_buff0_thd4~0_332) (= 0 v_~__unbuffered_p3_EBX~0_219) (= v_~z$r_buff0_thd2~0_78 0) (= v_~main$tmp_guard1~0_24 0) (= v_~z$r_buff1_thd0~0_431 0) (= v_~b~0_98 0) (= v_~__unbuffered_p3_EAX~0_219 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_42|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_18|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_207, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_72|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_23|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_40|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_35|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_134|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ~a~0=v_~a~0_207, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_415, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_332, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_219, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_37, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_66|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_23|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_609, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_54, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_52|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_76|, ~weak$$choice0~0=v_~weak$$choice0~0_32, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_5, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_189, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~x~0=v_~x~0_53, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_36|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_42|, ~z$w_buff1~0=v_~z$w_buff1~0_367, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_30|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_5, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_44|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_48|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_431, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_18|, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_56|, ~y~0=v_~y~0_52, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_22|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1261~0.base=|v_ULTIMATE.start_main_~#t1261~0.base_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_830, ~z$w_buff0~0=v_~z$w_buff0~0_376, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_56|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_278, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_219, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_55|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_70|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_34|, ~b~0=v_~b~0_98, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ULTIMATE.start_main_~#t1261~0.offset=|v_ULTIMATE.start_main_~#t1261~0.offset_17|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_9|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_20|, ~z~0=v_~z~0_157, ~weak$$choice2~0=v_~weak$$choice2~0_172, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_77} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1263~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t1262~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1264~0.offset, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet26, ~y~0, ULTIMATE.start_main_~#t1263~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1261~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t1261~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:45:43,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t1262~0.offset_11| 0) (= (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13| 1) |v_#valid_44|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1262~0.base_13|) (= (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1262~0.base_13|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1262~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1262~0.base_13|) |v_ULTIMATE.start_main_~#t1262~0.offset_11| 1)) |v_#memory_int_15|) (not (= 0 |v_ULTIMATE.start_main_~#t1262~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1262~0.base=|v_ULTIMATE.start_main_~#t1262~0.base_13|, ULTIMATE.start_main_~#t1262~0.offset=|v_ULTIMATE.start_main_~#t1262~0.offset_11|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1262~0.base, ULTIMATE.start_main_~#t1262~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-26 22:45:43,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L833-1-->L835: Formula: (and (= |v_ULTIMATE.start_main_~#t1263~0.offset_10| 0) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11| 1) |v_#valid_40|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1263~0.base_11| 4)) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1263~0.base_11|) 0) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1263~0.base_11|) |v_ULTIMATE.start_main_~#t1263~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1263~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1263~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1263~0.offset=|v_ULTIMATE.start_main_~#t1263~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1263~0.base=|v_ULTIMATE.start_main_~#t1263~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1263~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1263~0.base] because there is no mapped edge [2019-12-26 22:45:43,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L835-1-->L837: Formula: (and (= |v_ULTIMATE.start_main_~#t1264~0.offset_11| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1264~0.base_13|) |v_ULTIMATE.start_main_~#t1264~0.offset_11| 3)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1264~0.base_13|) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1264~0.base_13| 1) |v_#valid_46|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1264~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1264~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1264~0.base=|v_ULTIMATE.start_main_~#t1264~0.base_13|, ULTIMATE.start_main_~#t1264~0.offset=|v_ULTIMATE.start_main_~#t1264~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1264~0.base, ULTIMATE.start_main_~#t1264~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-26 22:45:43,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L4-->L808: Formula: (and (= v_~z$r_buff0_thd4~0_36 1) (= v_~z$r_buff1_thd2~0_8 v_~z$r_buff0_thd2~0_7) (= v_~z$r_buff0_thd0~0_114 v_~z$r_buff1_thd0~0_75) (= 1 v_~a~0_7) (= v_~z$r_buff0_thd4~0_37 v_~z$r_buff1_thd4~0_34) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18 0)) (= v_~__unbuffered_p3_EAX~0_8 v_~a~0_7) (= v_~z$r_buff1_thd1~0_8 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd3~0_42 v_~z$r_buff1_thd3~0_34) (= v_~b~0_17 v_~__unbuffered_p3_EBX~0_8)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_37, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_18, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_34, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_34, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_8, ~a~0=v_~a~0_7, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_114, ~b~0=v_~b~0_17, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_75, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_8, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_36, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_42, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_7} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:45:43,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_21 |v_P0Thread1of1ForFork0_#in~arg.offset_21|) (= v_~b~0_62 1) (= v_P0Thread1of1ForFork0_~arg.base_21 |v_P0Thread1of1ForFork0_#in~arg.base_21|) (= |v_P0Thread1of1ForFork0_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_11|) (= v_~__unbuffered_cnt~0_119 (+ v_~__unbuffered_cnt~0_120 1)) (= v_~x~0_42 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_120} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_21|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_11|, ~b~0=v_~b~0_62, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_21|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_119, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_21, ~x~0=v_~x~0_42, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_21} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:45:43,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= v_~y~0_33 1) (= v_~x~0_29 2) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~y~0=v_~y~0_33, ~x~0=v_~x~0_29, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:45:43,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L809-->L809-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1272944240 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1272944240 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1272944240| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite11_Out-1272944240| ~z$w_buff0_used~0_In-1272944240)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1272944240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1272944240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1272944240, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1272944240, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-1272944240|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:45:43,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd4~0_In-2010060642 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-2010060642 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-2010060642 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2010060642 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out-2010060642|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-2010060642 |P3Thread1of1ForFork3_#t~ite12_Out-2010060642|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2010060642, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010060642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2010060642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2010060642} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2010060642, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2010060642, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2010060642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2010060642, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-2010060642|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:45:43,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L772-2-->L772-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In2107997673 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In2107997673 256)))) (or (and (= ~z$w_buff1~0_In2107997673 |P2Thread1of1ForFork2_#t~ite3_Out2107997673|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In2107997673 |P2Thread1of1ForFork2_#t~ite3_Out2107997673|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2107997673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2107997673, ~z$w_buff1~0=~z$w_buff1~0_In2107997673, ~z~0=~z~0_In2107997673} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out2107997673|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2107997673, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2107997673, ~z$w_buff1~0=~z$w_buff1~0_In2107997673, ~z~0=~z~0_In2107997673} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:45:43,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-4-->L773: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_10| v_~z~0_32) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_10|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_15|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_9|, ~z~0=v_~z~0_32} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:45:43,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-687571610 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-687571610 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-687571610|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-687571610 |P2Thread1of1ForFork2_#t~ite5_Out-687571610|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-687571610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-687571610} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-687571610|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-687571610, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-687571610} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:45:43,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L774-->L774-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1609095594 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1609095594 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1609095594 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1609095594 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1609095594| ~z$w_buff1_used~0_In-1609095594) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1609095594| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1609095594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1609095594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1609095594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1609095594} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1609095594|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1609095594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1609095594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1609095594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1609095594} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:45:43,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1533686816 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1533686816 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite7_Out1533686816|) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out1533686816| ~z$r_buff0_thd3~0_In1533686816)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1533686816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1533686816} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1533686816, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1533686816, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1533686816|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:45:43,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1279537412 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1279537412 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1279537412 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1279537412 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1279537412 |P2Thread1of1ForFork2_#t~ite8_Out-1279537412|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out-1279537412|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1279537412, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1279537412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1279537412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1279537412} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1279537412, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1279537412, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1279537412, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1279537412, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out-1279537412|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:45:43,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L776-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite8_36| v_~z$r_buff1_thd3~0_64) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_36|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_64, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_35|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:45:43,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L811-->L812: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In30981654 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In30981654 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out30981654 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out30981654 ~z$r_buff0_thd4~0_In30981654)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In30981654, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In30981654} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In30981654, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out30981654, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out30981654|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:45:43,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In1058706426 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1058706426 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1058706426 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1058706426 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out1058706426| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out1058706426| ~z$r_buff1_thd4~0_In1058706426)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1058706426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1058706426, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1058706426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1058706426} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1058706426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1058706426, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1058706426|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1058706426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1058706426} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:45:43,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L812-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_107 (+ v_~__unbuffered_cnt~0_108 1)) (= |v_P3Thread1of1ForFork3_#t~ite14_46| v_~z$r_buff1_thd4~0_75) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_108} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_75, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_45|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:45:43,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L837-1-->L843: Formula: (and (= 4 v_~__unbuffered_cnt~0_62) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_8|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-26 22:45:43,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L843-2-->L843-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite20_Out-176513079| |ULTIMATE.start_main_#t~ite19_Out-176513079|)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-176513079 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-176513079 256)))) (or (and .cse0 (= ~z~0_In-176513079 |ULTIMATE.start_main_#t~ite19_Out-176513079|) (or .cse1 .cse2)) (and .cse0 (= ~z$w_buff1~0_In-176513079 |ULTIMATE.start_main_#t~ite19_Out-176513079|) (not .cse1) (not .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-176513079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-176513079, ~z$w_buff1~0=~z$w_buff1~0_In-176513079, ~z~0=~z~0_In-176513079} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-176513079|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-176513079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-176513079, ~z$w_buff1~0=~z$w_buff1~0_In-176513079, ~z~0=~z~0_In-176513079, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-176513079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:45:43,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-282027479 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-282027479 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite21_Out-282027479|)) (and (= |ULTIMATE.start_main_#t~ite21_Out-282027479| ~z$w_buff0_used~0_In-282027479) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-282027479, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-282027479} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-282027479, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-282027479, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-282027479|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:45:43,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L845-->L845-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1420105575 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1420105575 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1420105575 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1420105575 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out1420105575| ~z$w_buff1_used~0_In1420105575) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out1420105575| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1420105575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1420105575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1420105575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420105575} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1420105575, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1420105575, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1420105575, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1420105575, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out1420105575|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:45:43,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In326901988 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In326901988 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite23_Out326901988| ~z$r_buff0_thd0~0_In326901988)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite23_Out326901988| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In326901988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In326901988} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In326901988, ~z$w_buff0_used~0=~z$w_buff0_used~0_In326901988, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out326901988|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:45:43,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-944902485 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-944902485 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-944902485 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-944902485 256)))) (or (and (= ~z$r_buff1_thd0~0_In-944902485 |ULTIMATE.start_main_#t~ite24_Out-944902485|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite24_Out-944902485|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-944902485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-944902485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-944902485, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-944902485} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-944902485, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-944902485, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-944902485, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-944902485|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-944902485} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:45:43,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L855-->L855-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-150583873 256)))) (or (and (= |ULTIMATE.start_main_#t~ite30_In-150583873| |ULTIMATE.start_main_#t~ite30_Out-150583873|) (= ~z$w_buff0~0_In-150583873 |ULTIMATE.start_main_#t~ite31_Out-150583873|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-150583873 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In-150583873 256)) (and (= (mod ~z$r_buff1_thd0~0_In-150583873 256) 0) .cse1) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-150583873 256))))) (= |ULTIMATE.start_main_#t~ite30_Out-150583873| ~z$w_buff0~0_In-150583873) .cse0 (= |ULTIMATE.start_main_#t~ite30_Out-150583873| |ULTIMATE.start_main_#t~ite31_Out-150583873|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-150583873, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_In-150583873|, ~z$w_buff0~0=~z$w_buff0~0_In-150583873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-150583873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-150583873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-150583873, ~weak$$choice2~0=~weak$$choice2~0_In-150583873} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-150583873, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-150583873|, ~z$w_buff0~0=~z$w_buff0~0_In-150583873, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-150583873, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-150583873, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-150583873, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-150583873|, ~weak$$choice2~0=~weak$$choice2~0_In-150583873} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite31] because there is no mapped edge [2019-12-26 22:45:43,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L856-->L856-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-599855602 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite34_Out-599855602| |ULTIMATE.start_main_#t~ite33_Out-599855602|) (= ~z$w_buff1~0_In-599855602 |ULTIMATE.start_main_#t~ite33_Out-599855602|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-599855602 256) 0))) (or (and (= 0 (mod ~z$r_buff1_thd0~0_In-599855602 256)) .cse1) (and .cse1 (= (mod ~z$w_buff1_used~0_In-599855602 256) 0)) (= (mod ~z$w_buff0_used~0_In-599855602 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite33_In-599855602| |ULTIMATE.start_main_#t~ite33_Out-599855602|) (= |ULTIMATE.start_main_#t~ite34_Out-599855602| ~z$w_buff1~0_In-599855602) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599855602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599855602, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-599855602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599855602, ~z$w_buff1~0=~z$w_buff1~0_In-599855602, ~weak$$choice2~0=~weak$$choice2~0_In-599855602, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_In-599855602|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-599855602, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-599855602, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-599855602, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-599855602, ~z$w_buff1~0=~z$w_buff1~0_In-599855602, ~weak$$choice2~0=~weak$$choice2~0_In-599855602, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out-599855602|, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-599855602|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-26 22:45:43,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L859-->L860: Formula: (and (= v_~z$r_buff0_thd0~0_108 v_~z$r_buff0_thd0~0_107) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_107, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:45:43,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In159232467 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite46_Out159232467| |ULTIMATE.start_main_#t~ite45_Out159232467|) (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In159232467 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In159232467 256)) (and (= 0 (mod ~z$w_buff1_used~0_In159232467 256)) .cse1) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In159232467 256))))) (= ~z$r_buff1_thd0~0_In159232467 |ULTIMATE.start_main_#t~ite45_Out159232467|)) (and (not .cse0) (= ~z$r_buff1_thd0~0_In159232467 |ULTIMATE.start_main_#t~ite46_Out159232467|) (= |ULTIMATE.start_main_#t~ite45_In159232467| |ULTIMATE.start_main_#t~ite45_Out159232467|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In159232467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In159232467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In159232467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In159232467, ~weak$$choice2~0=~weak$$choice2~0_In159232467, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In159232467|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In159232467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In159232467, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In159232467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In159232467, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out159232467|, ~weak$$choice2~0=~weak$$choice2~0_In159232467, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out159232467|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 22:45:43,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L862-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_8 256)) (not (= 0 (mod v_~z$flush_delayed~0_30 256))) (= v_~z$mem_tmp~0_20 v_~z~0_83) (= 0 v_~z$flush_delayed~0_29)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_30} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_20, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_17|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_29, ~z~0=v_~z~0_83, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:45:43,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:45:43,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:45:43 BasicIcfg [2019-12-26 22:45:43,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:45:43,703 INFO L168 Benchmark]: Toolchain (without parser) took 30917.45 ms. Allocated memory was 137.4 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 100.6 MB in the beginning and 922.5 MB in the end (delta: -822.0 MB). Peak memory consumption was 329.4 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,703 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 22:45:43,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.91 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 152.5 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,705 INFO L168 Benchmark]: Boogie Preprocessor took 39.70 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,706 INFO L168 Benchmark]: RCFGBuilder took 820.76 ms. Allocated memory is still 201.9 MB. Free memory was 147.4 MB in the beginning and 98.3 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,707 INFO L168 Benchmark]: TraceAbstraction took 29168.90 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 97.3 MB in the beginning and 922.5 MB in the end (delta: -825.3 MB). Peak memory consumption was 261.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:45:43,711 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.17 ms. Allocated memory is still 137.4 MB. Free memory is still 120.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.91 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.1 MB in the beginning and 152.5 MB in the end (delta: -52.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.58 ms. Allocated memory is still 201.9 MB. Free memory was 152.5 MB in the beginning and 149.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.70 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 147.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 820.76 ms. Allocated memory is still 201.9 MB. Free memory was 147.4 MB in the beginning and 98.3 MB in the end (delta: 49.1 MB). Peak memory consumption was 49.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29168.90 ms. Allocated memory was 201.9 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 97.3 MB in the beginning and 922.5 MB in the end (delta: -825.3 MB). Peak memory consumption was 261.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 180 ProgramPointsBefore, 89 ProgramPointsAfterwards, 208 TransitionsBefore, 95 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 27 ChoiceCompositions, 5121 VarBasedMoverChecksPositive, 269 VarBasedMoverChecksNegative, 136 SemBasedMoverChecksPositive, 198 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 49999 CheckedPairsTotal, 122 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1261, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1262, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1263, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1264, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 4 z$w_buff1 = z$w_buff0 [L787] 4 z$w_buff0 = 2 [L788] 4 z$w_buff1_used = z$w_buff0_used [L789] 4 z$w_buff0_used = (_Bool)1 [L808] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 3 y = 2 [L769] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L772] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L773] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L810] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L844] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L845] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L846] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L847] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L851] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L852] 0 z$flush_delayed = weak$$choice2 [L853] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L855] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L856] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L857] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.9s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1708 SDtfs, 2117 SDslu, 4893 SDs, 0 SdLazy, 2301 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47746occurred 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: 9.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 6189 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 814 NumberOfCodeBlocks, 814 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 737 ConstructedInterpolants, 0 QuantifiedInterpolants, 208788 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...