/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:36:50,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:36:50,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:36:50,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:36:50,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:36:50,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:36:50,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:36:50,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:36:50,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:36:50,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:36:50,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:36:50,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:36:50,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:36:50,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:36:50,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:36:50,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:36:50,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:36:50,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:36:50,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:36:50,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:36:50,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:36:50,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:36:50,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:36:50,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:36:50,520 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:36:50,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:36:50,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:36:50,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:36:50,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:36:50,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:36:50,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:36:50,526 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:36:50,527 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:36:50,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:36:50,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:36:50,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:36:50,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:36:50,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:36:50,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:36:50,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:36:50,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:36:50,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:36:50,564 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:36:50,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:36:50,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:36:50,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:36:50,570 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:36:50,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:36:50,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:36:50,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:36:50,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:36:50,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:36:50,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:36:50,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:36:50,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:36:50,573 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:36:50,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:36:50,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:36:50,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:36:50,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:36:50,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:36:50,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:36:50,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:36:50,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:36:50,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:36:50,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:36:50,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:36:50,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:36:50,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:36:50,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:36:50,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:36:50,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:36:50,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:36:50,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:36:50,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:36:50,877 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:36:50,877 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:36:50,878 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i [2019-12-18 21:36:50,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00053e6fb/165fe830907e4fed907cc750b869cbe5/FLAG5dd973a54 [2019-12-18 21:36:51,552 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:36:51,553 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_tso.opt.i [2019-12-18 21:36:51,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00053e6fb/165fe830907e4fed907cc750b869cbe5/FLAG5dd973a54 [2019-12-18 21:36:51,793 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00053e6fb/165fe830907e4fed907cc750b869cbe5 [2019-12-18 21:36:51,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:36:51,807 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:36:51,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:51,809 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:36:51,812 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:36:51,814 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:51" (1/1) ... [2019-12-18 21:36:51,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115225be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:51, skipping insertion in model container [2019-12-18 21:36:51,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:51" (1/1) ... [2019-12-18 21:36:51,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:36:51,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:36:52,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:52,426 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:36:52,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:52,628 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:36:52,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52 WrapperNode [2019-12-18 21:36:52,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:52,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:52,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:36:52,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:36:52,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:52,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:36:52,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:36:52,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:36:52,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... [2019-12-18 21:36:52,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:36:52,739 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:36:52,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:36:52,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:36:52,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:36:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:36:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:36:52,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:36:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:36:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:36:52,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:36:52,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:36:52,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:36:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:36:52,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:36:52,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:36:52,812 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:36:53,561 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:36:53,561 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:36:53,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:53 BoogieIcfgContainer [2019-12-18 21:36:53,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:36:53,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:36:53,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:36:53,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:36:53,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:36:51" (1/3) ... [2019-12-18 21:36:53,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e39bff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:53, skipping insertion in model container [2019-12-18 21:36:53,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:52" (2/3) ... [2019-12-18 21:36:53,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e39bff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:53, skipping insertion in model container [2019-12-18 21:36:53,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:53" (3/3) ... [2019-12-18 21:36:53,572 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_tso.opt.i [2019-12-18 21:36:53,581 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:36:53,582 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:36:53,592 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:36:53,593 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:36:53,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,641 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,642 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,643 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,644 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,645 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,646 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,647 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,648 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,652 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,655 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,657 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,658 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,670 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,673 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,678 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,729 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,737 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,741 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:53,759 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:36:53,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:36:53,774 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:36:53,774 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:36:53,774 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:36:53,775 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:36:53,775 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:36:53,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:36:53,775 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:36:53,791 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:36:53,794 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:53,881 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:53,882 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:53,903 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:36:53,922 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:54,003 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:54,004 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:54,012 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:36:54,030 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:36:54,031 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:36:57,411 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:36:57,532 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:36:57,560 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 21:36:57,560 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:36:57,564 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 21:36:57,980 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:36:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:36:57,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:36:57,991 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:57,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:36:57,992 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 21:36:58,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:58,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293259046] [2019-12-18 21:36:58,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:58,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293259046] [2019-12-18 21:36:58,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:58,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:36:58,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531311488] [2019-12-18 21:36:58,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:58,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:58,288 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:36:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:58,622 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 21:36:58,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:58,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:36:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:58,734 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 21:36:58,734 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 21:36:58,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 21:36:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 21:36:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 21:36:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 21:36:59,218 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 21:36:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:59,218 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 21:36:59,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:59,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 21:36:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:36:59,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:59,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:59,226 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:59,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:59,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 21:36:59,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:59,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116492726] [2019-12-18 21:36:59,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:59,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116492726] [2019-12-18 21:36:59,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:59,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:59,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942999241] [2019-12-18 21:36:59,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:59,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:59,411 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 21:36:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:59,751 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-18 21:36:59,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:59,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:36:59,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:59,821 INFO L225 Difference]: With dead ends: 11318 [2019-12-18 21:36:59,821 INFO L226 Difference]: Without dead ends: 11311 [2019-12-18 21:36:59,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-18 21:37:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-18 21:37:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-18 21:37:00,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-18 21:37:00,262 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-18 21:37:00,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:00,262 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-18 21:37:00,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:37:00,262 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-18 21:37:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:37:00,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:00,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:37:00,276 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 21:37:00,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:00,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657807405] [2019-12-18 21:37:00,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:00,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657807405] [2019-12-18 21:37:00,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:00,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:37:00,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614495894] [2019-12-18 21:37:00,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:37:00,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:00,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:37:00,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:37:00,413 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-18 21:37:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:00,747 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-18 21:37:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:37:00,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:37:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:00,799 INFO L225 Difference]: With dead ends: 14191 [2019-12-18 21:37:00,799 INFO L226 Difference]: Without dead ends: 14191 [2019-12-18 21:37:00,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:37:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-18 21:37:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-18 21:37:01,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-18 21:37:01,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-18 21:37:01,791 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-18 21:37:01,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:01,794 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-18 21:37:01,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:37:01,795 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-18 21:37:01,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:37:01,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:01,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:37:01,799 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:01,799 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-18 21:37:01,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:01,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666000] [2019-12-18 21:37:01,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:01,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666000] [2019-12-18 21:37:01,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:01,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:37:01,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541511848] [2019-12-18 21:37:01,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:37:01,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:37:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:37:01,932 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 4 states. [2019-12-18 21:37:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:01,978 INFO L93 Difference]: Finished difference Result 2163 states and 5380 transitions. [2019-12-18 21:37:01,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:37:01,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:37:01,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:01,984 INFO L225 Difference]: With dead ends: 2163 [2019-12-18 21:37:01,984 INFO L226 Difference]: Without dead ends: 1539 [2019-12-18 21:37:01,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:37:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-12-18 21:37:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1523. [2019-12-18 21:37:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-18 21:37:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-18 21:37:02,014 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 16 [2019-12-18 21:37:02,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:02,015 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-18 21:37:02,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:37:02,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-18 21:37:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:37:02,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:02,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:37:02,017 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 21:37:02,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:02,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453697354] [2019-12-18 21:37:02,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:02,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453697354] [2019-12-18 21:37:02,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:02,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:37:02,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654352508] [2019-12-18 21:37:02,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:37:02,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:02,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:37:02,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:37:02,157 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-18 21:37:02,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:02,606 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-18 21:37:02,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:37:02,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:37:02,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:02,613 INFO L225 Difference]: With dead ends: 2313 [2019-12-18 21:37:02,614 INFO L226 Difference]: Without dead ends: 2260 [2019-12-18 21:37:02,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:37:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-18 21:37:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-18 21:37:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-18 21:37:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-18 21:37:02,725 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-18 21:37:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:02,726 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-18 21:37:02,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:37:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-18 21:37:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 21:37:02,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:02,729 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] [2019-12-18 21:37:02,729 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:02,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:02,729 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-18 21:37:02,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:02,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712437405] [2019-12-18 21:37:02,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:02,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:02,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712437405] [2019-12-18 21:37:02,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:02,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:37:02,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373842020] [2019-12-18 21:37:02,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:37:02,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:02,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:37:02,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:37:02,857 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 5 states. [2019-12-18 21:37:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:03,287 INFO L93 Difference]: Finished difference Result 2343 states and 5072 transitions. [2019-12-18 21:37:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:37:03,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 21:37:03,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:03,293 INFO L225 Difference]: With dead ends: 2343 [2019-12-18 21:37:03,293 INFO L226 Difference]: Without dead ends: 2343 [2019-12-18 21:37:03,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:37:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2343 states. [2019-12-18 21:37:03,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2343 to 2045. [2019-12-18 21:37:03,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-18 21:37:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4487 transitions. [2019-12-18 21:37:03,332 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4487 transitions. Word has length 26 [2019-12-18 21:37:03,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:03,332 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4487 transitions. [2019-12-18 21:37:03,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:37:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4487 transitions. [2019-12-18 21:37:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:37:03,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:03,336 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:37:03,336 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:03,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:03,336 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-18 21:37:03,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:03,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375556261] [2019-12-18 21:37:03,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:03,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375556261] [2019-12-18 21:37:03,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:03,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:37:03,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16629080] [2019-12-18 21:37:03,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:37:03,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:03,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:37:03,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:37:03,421 INFO L87 Difference]: Start difference. First operand 2045 states and 4487 transitions. Second operand 5 states. [2019-12-18 21:37:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:03,465 INFO L93 Difference]: Finished difference Result 1263 states and 2646 transitions. [2019-12-18 21:37:03,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:37:03,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:37:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:03,468 INFO L225 Difference]: With dead ends: 1263 [2019-12-18 21:37:03,468 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 21:37:03,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:37:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 21:37:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 1055. [2019-12-18 21:37:03,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1055 states. [2019-12-18 21:37:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 2231 transitions. [2019-12-18 21:37:03,487 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 2231 transitions. Word has length 27 [2019-12-18 21:37:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:03,487 INFO L462 AbstractCegarLoop]: Abstraction has 1055 states and 2231 transitions. [2019-12-18 21:37:03,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:37:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 2231 transitions. [2019-12-18 21:37:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:37:03,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:03,496 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] [2019-12-18 21:37:03,496 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:03,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:03,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1622987432, now seen corresponding path program 1 times [2019-12-18 21:37:03,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:03,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643269127] [2019-12-18 21:37:03,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:03,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643269127] [2019-12-18 21:37:03,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:03,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:37:03,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631982513] [2019-12-18 21:37:03,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:37:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:37:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:37:03,647 INFO L87 Difference]: Start difference. First operand 1055 states and 2231 transitions. Second operand 7 states. [2019-12-18 21:37:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:03,948 INFO L93 Difference]: Finished difference Result 3013 states and 6181 transitions. [2019-12-18 21:37:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:37:03,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:37:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:03,952 INFO L225 Difference]: With dead ends: 3013 [2019-12-18 21:37:03,952 INFO L226 Difference]: Without dead ends: 2064 [2019-12-18 21:37:03,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:37:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-18 21:37:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1102. [2019-12-18 21:37:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-18 21:37:03,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 2323 transitions. [2019-12-18 21:37:03,975 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 2323 transitions. Word has length 51 [2019-12-18 21:37:03,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:03,976 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 2323 transitions. [2019-12-18 21:37:03,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:37:03,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 2323 transitions. [2019-12-18 21:37:03,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:37:03,979 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:03,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] [2019-12-18 21:37:03,979 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:03,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:03,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2012209130, now seen corresponding path program 2 times [2019-12-18 21:37:03,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:03,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650152309] [2019-12-18 21:37:03,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:04,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650152309] [2019-12-18 21:37:04,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:04,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:37:04,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853557771] [2019-12-18 21:37:04,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:37:04,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:04,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:37:04,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:37:04,046 INFO L87 Difference]: Start difference. First operand 1102 states and 2323 transitions. Second operand 4 states. [2019-12-18 21:37:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:04,116 INFO L93 Difference]: Finished difference Result 1851 states and 3924 transitions. [2019-12-18 21:37:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:37:04,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-18 21:37:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:04,118 INFO L225 Difference]: With dead ends: 1851 [2019-12-18 21:37:04,118 INFO L226 Difference]: Without dead ends: 818 [2019-12-18 21:37:04,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:37:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-12-18 21:37:04,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 818. [2019-12-18 21:37:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 818 states. [2019-12-18 21:37:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1731 transitions. [2019-12-18 21:37:04,131 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1731 transitions. Word has length 51 [2019-12-18 21:37:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:04,131 INFO L462 AbstractCegarLoop]: Abstraction has 818 states and 1731 transitions. [2019-12-18 21:37:04,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:37:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1731 transitions. [2019-12-18 21:37:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:37:04,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:04,134 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] [2019-12-18 21:37:04,134 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:04,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:04,135 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 3 times [2019-12-18 21:37:04,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:04,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625756630] [2019-12-18 21:37:04,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:04,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625756630] [2019-12-18 21:37:04,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:04,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:37:04,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078714165] [2019-12-18 21:37:04,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:37:04,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:37:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:37:04,278 INFO L87 Difference]: Start difference. First operand 818 states and 1731 transitions. Second operand 7 states. [2019-12-18 21:37:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:04,475 INFO L93 Difference]: Finished difference Result 1396 states and 2860 transitions. [2019-12-18 21:37:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:37:04,475 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 21:37:04,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:04,477 INFO L225 Difference]: With dead ends: 1396 [2019-12-18 21:37:04,477 INFO L226 Difference]: Without dead ends: 948 [2019-12-18 21:37:04,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:37:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2019-12-18 21:37:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 794. [2019-12-18 21:37:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-12-18 21:37:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1681 transitions. [2019-12-18 21:37:04,496 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1681 transitions. Word has length 51 [2019-12-18 21:37:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:04,496 INFO L462 AbstractCegarLoop]: Abstraction has 794 states and 1681 transitions. [2019-12-18 21:37:04,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:37:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1681 transitions. [2019-12-18 21:37:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 21:37:04,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:04,499 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] [2019-12-18 21:37:04,499 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:04,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:04,500 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 4 times [2019-12-18 21:37:04,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:04,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27024731] [2019-12-18 21:37:04,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:04,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27024731] [2019-12-18 21:37:04,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:04,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:37:04,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196282962] [2019-12-18 21:37:04,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:37:04,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:04,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:37:04,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:37:04,603 INFO L87 Difference]: Start difference. First operand 794 states and 1681 transitions. Second operand 3 states. [2019-12-18 21:37:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:04,658 INFO L93 Difference]: Finished difference Result 1036 states and 2174 transitions. [2019-12-18 21:37:04,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:37:04,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 21:37:04,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:04,660 INFO L225 Difference]: With dead ends: 1036 [2019-12-18 21:37:04,660 INFO L226 Difference]: Without dead ends: 1036 [2019-12-18 21:37:04,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:37:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-12-18 21:37:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 840. [2019-12-18 21:37:04,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-18 21:37:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1784 transitions. [2019-12-18 21:37:04,679 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1784 transitions. Word has length 51 [2019-12-18 21:37:04,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:04,680 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1784 transitions. [2019-12-18 21:37:04,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:37:04,680 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1784 transitions. [2019-12-18 21:37:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:37:04,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:04,683 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] [2019-12-18 21:37:04,684 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:04,684 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-18 21:37:04,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:04,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806362915] [2019-12-18 21:37:04,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:04,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806362915] [2019-12-18 21:37:04,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:04,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:37:04,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851196785] [2019-12-18 21:37:04,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:37:04,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:04,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:37:04,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:37:04,851 INFO L87 Difference]: Start difference. First operand 840 states and 1784 transitions. Second operand 6 states. [2019-12-18 21:37:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:05,288 INFO L93 Difference]: Finished difference Result 993 states and 2070 transitions. [2019-12-18 21:37:05,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:37:05,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-18 21:37:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:05,289 INFO L225 Difference]: With dead ends: 993 [2019-12-18 21:37:05,290 INFO L226 Difference]: Without dead ends: 993 [2019-12-18 21:37:05,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:37:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-12-18 21:37:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 900. [2019-12-18 21:37:05,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-18 21:37:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1900 transitions. [2019-12-18 21:37:05,305 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1900 transitions. Word has length 52 [2019-12-18 21:37:05,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:05,305 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1900 transitions. [2019-12-18 21:37:05,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:37:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1900 transitions. [2019-12-18 21:37:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:37:05,308 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:05,308 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] [2019-12-18 21:37:05,308 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:05,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:05,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-18 21:37:05,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:05,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200381280] [2019-12-18 21:37:05,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:05,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:37:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:37:05,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200381280] [2019-12-18 21:37:05,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:37:05,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:37:05,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966715715] [2019-12-18 21:37:05,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:37:05,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:37:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:37:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:37:05,383 INFO L87 Difference]: Start difference. First operand 900 states and 1900 transitions. Second operand 3 states. [2019-12-18 21:37:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:37:05,395 INFO L93 Difference]: Finished difference Result 899 states and 1898 transitions. [2019-12-18 21:37:05,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:37:05,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:37:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:37:05,397 INFO L225 Difference]: With dead ends: 899 [2019-12-18 21:37:05,397 INFO L226 Difference]: Without dead ends: 899 [2019-12-18 21:37:05,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:37:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-18 21:37:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 743. [2019-12-18 21:37:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 21:37:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-18 21:37:05,410 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-18 21:37:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:37:05,411 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-18 21:37:05,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:37:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-18 21:37:05,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:37:05,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:37:05,413 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] [2019-12-18 21:37:05,414 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:37:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:37:05,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 21:37:05,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:37:05,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213287324] [2019-12-18 21:37:05,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:37:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:37:05,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:37:05,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:37:05,526 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:37:05,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= (store .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_24| 1) |v_#valid_49|) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1295~0.base_24|) |v_ULTIMATE.start_main_~#t1295~0.offset_19| 0))) (= |v_#NULL.offset_6| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1295~0.base_24| 4)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1295~0.base_24|) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 |v_ULTIMATE.start_main_~#t1295~0.offset_19|) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1295~0.base_24|)) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_19|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1295~0.base=|v_ULTIMATE.start_main_~#t1295~0.base_24|, ULTIMATE.start_main_~#t1295~0.offset=|v_ULTIMATE.start_main_~#t1295~0.offset_19|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ULTIMATE.start_main_~#t1296~0.offset, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1295~0.base, ULTIMATE.start_main_~#t1295~0.offset, ULTIMATE.start_main_~#t1296~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:37:05,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1296~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1296~0.base_13|) |v_ULTIMATE.start_main_~#t1296~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t1296~0.offset_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1296~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1296~0.base_13|)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1296~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1296~0.base=|v_ULTIMATE.start_main_~#t1296~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1296~0.offset=|v_ULTIMATE.start_main_~#t1296~0.offset_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1296~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1296~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:37:05,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out577383118 1) (= ~y$r_buff0_thd1~0_In577383118 ~y$r_buff1_thd1~0_Out577383118) (= ~y$r_buff1_thd2~0_Out577383118 ~y$r_buff0_thd2~0_In577383118) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In577383118)) (= ~y$r_buff0_thd0~0_In577383118 ~y$r_buff1_thd0~0_Out577383118) (= ~x~0_In577383118 ~__unbuffered_p0_EAX~0_Out577383118)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In577383118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In577383118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577383118, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In577383118, ~x~0=~x~0_In577383118} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out577383118, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out577383118, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out577383118, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In577383118, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out577383118, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In577383118, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In577383118, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out577383118, ~x~0=~x~0_In577383118} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:37:05,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1270303851 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1270303851 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1270303851| ~y$w_buff0_used~0_In1270303851)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1270303851| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1270303851, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1270303851} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1270303851|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1270303851, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1270303851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:37:05,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1390421698 256)))) (or (and (= ~y$w_buff0_used~0_In1390421698 |P1Thread1of1ForFork1_#t~ite21_Out1390421698|) (= |P1Thread1of1ForFork1_#t~ite20_In1390421698| |P1Thread1of1ForFork1_#t~ite20_Out1390421698|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1390421698| |P1Thread1of1ForFork1_#t~ite21_Out1390421698|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1390421698 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1390421698 256))) (= (mod ~y$w_buff0_used~0_In1390421698 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1390421698 256) 0) .cse1))) .cse0 (= ~y$w_buff0_used~0_In1390421698 |P1Thread1of1ForFork1_#t~ite20_Out1390421698|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390421698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390421698, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1390421698|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390421698, ~weak$$choice2~0=~weak$$choice2~0_In1390421698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390421698} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390421698, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390421698, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1390421698|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390421698, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1390421698|, ~weak$$choice2~0=~weak$$choice2~0_In1390421698, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390421698} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:37:05,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd2~0_In1450112845 256) 0)) (.cse5 (= 0 (mod ~y$w_buff1_used~0_In1450112845 256))) (.cse6 (= (mod ~y$r_buff0_thd2~0_In1450112845 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1450112845 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out1450112845| |P1Thread1of1ForFork1_#t~ite24_Out1450112845|)) (.cse0 (= (mod ~weak$$choice2~0_In1450112845 256) 0))) (or (let ((.cse1 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out1450112845| |P1Thread1of1ForFork1_#t~ite23_Out1450112845|) (= |P1Thread1of1ForFork1_#t~ite22_Out1450112845| 0) .cse0 (or .cse1 (not .cse2)) (not .cse3) .cse4 (or .cse1 (not .cse5)))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out1450112845| ~y$w_buff1_used~0_In1450112845) (or (and .cse6 .cse2) (and .cse5 .cse6) .cse3) .cse0 .cse4) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out1450112845| |P1Thread1of1ForFork1_#t~ite23_In1450112845|) (= |P1Thread1of1ForFork1_#t~ite24_Out1450112845| ~y$w_buff1_used~0_In1450112845))) (= |P1Thread1of1ForFork1_#t~ite22_In1450112845| |P1Thread1of1ForFork1_#t~ite22_Out1450112845|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1450112845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450112845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450112845, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In1450112845|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In1450112845|, ~weak$$choice2~0=~weak$$choice2~0_In1450112845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1450112845} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1450112845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1450112845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1450112845, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out1450112845|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out1450112845|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out1450112845|, ~weak$$choice2~0=~weak$$choice2~0_In1450112845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1450112845} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:37:05,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:37:05,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In1453092378 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1453092378 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1453092378 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1453092378 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1453092378 |P0Thread1of1ForFork0_#t~ite6_Out1453092378|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1453092378|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1453092378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1453092378, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1453092378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1453092378} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1453092378|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1453092378, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1453092378, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1453092378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1453092378} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:37:05,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1713454826 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1713454826 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1713454826 ~y$r_buff0_thd1~0_Out1713454826)) (and (= 0 ~y$r_buff0_thd1~0_Out1713454826) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1713454826, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1713454826} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1713454826, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1713454826|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1713454826} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:37:05,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse3 (= (mod ~weak$$choice2~0_In118351087 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In118351087 256) 0)) (.cse4 (= 0 (mod ~y$w_buff0_used~0_In118351087 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In118351087 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In118351087 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite30_Out118351087| |P1Thread1of1ForFork1_#t~ite29_Out118351087|))) (or (let ((.cse1 (not .cse6))) (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out118351087|) (or (not .cse0) .cse1) (or .cse1 (not .cse2)) .cse3 (= |P1Thread1of1ForFork1_#t~ite29_Out118351087| |P1Thread1of1ForFork1_#t~ite28_Out118351087|) (not .cse4) .cse5)) (and (= |P1Thread1of1ForFork1_#t~ite28_In118351087| |P1Thread1of1ForFork1_#t~ite28_Out118351087|) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In118351087| |P1Thread1of1ForFork1_#t~ite29_Out118351087|) (= |P1Thread1of1ForFork1_#t~ite30_Out118351087| ~y$r_buff1_thd2~0_In118351087) (not .cse3)) (and .cse3 (or (and .cse6 .cse2) .cse4 (and .cse6 .cse0)) (= ~y$r_buff1_thd2~0_In118351087 |P1Thread1of1ForFork1_#t~ite29_Out118351087|) .cse5))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118351087, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In118351087|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118351087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118351087, ~weak$$choice2~0=~weak$$choice2~0_In118351087, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In118351087|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118351087} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In118351087, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out118351087|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out118351087|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In118351087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In118351087, ~weak$$choice2~0=~weak$$choice2~0_In118351087, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out118351087|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In118351087} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:37:05,553 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In146796982 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In146796982 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In146796982 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In146796982 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out146796982|)) (and (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In146796982 |P0Thread1of1ForFork0_#t~ite8_Out146796982|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In146796982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In146796982, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In146796982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In146796982} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In146796982, ~y$w_buff0_used~0=~y$w_buff0_used~0_In146796982, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out146796982|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In146796982, ~y$w_buff1_used~0=~y$w_buff1_used~0_In146796982} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:37:05,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:37:05,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1247559571 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1247559571 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1247559571 |P1Thread1of1ForFork1_#t~ite32_Out-1247559571|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out-1247559571| ~y$w_buff1~0_In-1247559571) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1247559571, ~y$w_buff1~0=~y$w_buff1~0_In-1247559571, ~y~0=~y~0_In-1247559571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1247559571} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1247559571, ~y$w_buff1~0=~y$w_buff1~0_In-1247559571, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1247559571|, ~y~0=~y~0_In-1247559571, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1247559571} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:37:05,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 21:37:05,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1046733960 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1046733960 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1046733960| ~y$w_buff0_used~0_In-1046733960) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out-1046733960| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1046733960, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1046733960} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1046733960, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1046733960, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1046733960|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:37:05,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-44815875 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-44815875 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-44815875 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-44815875 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-44815875| ~y$w_buff1_used~0_In-44815875)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-44815875|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-44815875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-44815875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-44815875, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44815875} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-44815875, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-44815875, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-44815875, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-44815875|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-44815875} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:37:05,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In864211735 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In864211735 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In864211735 |P1Thread1of1ForFork1_#t~ite36_Out864211735|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out864211735|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In864211735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In864211735} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In864211735, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In864211735, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out864211735|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:37:05,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In438745985 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In438745985 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In438745985 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In438745985 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out438745985|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In438745985 |P1Thread1of1ForFork1_#t~ite37_Out438745985|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In438745985, ~y$w_buff0_used~0=~y$w_buff0_used~0_In438745985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In438745985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438745985} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In438745985, ~y$w_buff0_used~0=~y$w_buff0_used~0_In438745985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In438745985, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out438745985|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438745985} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:37:05,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:37:05,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:37:05,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:37:05,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1249799065 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1249799065 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In1249799065 |ULTIMATE.start_main_#t~ite40_Out1249799065|)) (and (= |ULTIMATE.start_main_#t~ite40_Out1249799065| ~y$w_buff1~0_In1249799065) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1249799065, ~y~0=~y~0_In1249799065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1249799065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249799065} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1249799065|, ~y$w_buff1~0=~y$w_buff1~0_In1249799065, ~y~0=~y~0_In1249799065, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1249799065, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249799065} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:37:05,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 21:37:05,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-445821622 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-445821622 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-445821622| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-445821622| ~y$w_buff0_used~0_In-445821622)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-445821622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445821622} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-445821622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-445821622, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-445821622|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:37:05,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1411451593 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1411451593 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1411451593 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1411451593 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1411451593| ~y$w_buff1_used~0_In1411451593) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite43_Out1411451593| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1411451593, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1411451593, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1411451593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411451593} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1411451593, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1411451593, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1411451593|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1411451593, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1411451593} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:37:05,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1497949696 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1497949696 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1497949696|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In1497949696 |ULTIMATE.start_main_#t~ite44_Out1497949696|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1497949696, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1497949696} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1497949696, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1497949696, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1497949696|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:37:05,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1693608224 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1693608224 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1693608224 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1693608224 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out-1693608224|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out-1693608224| ~y$r_buff1_thd0~0_In-1693608224) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1693608224, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1693608224, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1693608224, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1693608224} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1693608224, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1693608224, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1693608224, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1693608224|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1693608224} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:37:05,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:37:05,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:37:05 BasicIcfg [2019-12-18 21:37:05,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:37:05,662 INFO L168 Benchmark]: Toolchain (without parser) took 13851.86 ms. Allocated memory was 140.0 MB in the beginning and 564.1 MB in the end (delta: 424.1 MB). Free memory was 102.8 MB in the beginning and 194.9 MB in the end (delta: -92.0 MB). Peak memory consumption was 332.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,666 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 821.70 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 158.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,668 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 203.9 MB. Free memory was 158.5 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,669 INFO L168 Benchmark]: Boogie Preprocessor took 42.56 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,670 INFO L168 Benchmark]: RCFGBuilder took 823.41 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,674 INFO L168 Benchmark]: TraceAbstraction took 12092.91 ms. Allocated memory was 203.9 MB in the beginning and 564.1 MB in the end (delta: 360.2 MB). Free memory was 108.9 MB in the beginning and 194.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 274.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:37:05,684 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.48 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 821.70 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.4 MB in the beginning and 158.5 MB in the end (delta: -56.1 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.81 ms. Allocated memory is still 203.9 MB. Free memory was 158.5 MB in the beginning and 156.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.56 ms. Allocated memory is still 203.9 MB. Free memory was 156.0 MB in the beginning and 153.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.41 ms. Allocated memory is still 203.9 MB. Free memory was 153.4 MB in the beginning and 109.5 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12092.91 ms. Allocated memory was 203.9 MB in the beginning and 564.1 MB in the end (delta: 360.2 MB). Free memory was 108.9 MB in the beginning and 194.9 MB in the end (delta: -86.0 MB). Peak memory consumption was 274.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1295, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1296, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 1855 SDslu, 3506 SDs, 0 SdLazy, 1852 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 8 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 6943 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 50459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...