/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:32:52,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:32:52,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:32:52,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:32:52,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:32:52,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:32:52,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:32:52,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:32:52,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:32:52,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:32:52,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:32:52,625 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:32:52,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:32:52,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:32:52,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:32:52,629 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:32:52,629 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:32:52,630 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:32:52,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:32:52,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:32:52,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:32:52,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:32:52,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:32:52,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:32:52,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:32:52,640 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:32:52,640 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:32:52,641 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:32:52,641 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:32:52,642 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:32:52,642 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:32:52,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:32:52,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:32:52,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:32:52,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:32:52,646 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:32:52,647 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:32:52,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:32:52,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:32:52,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:32:52,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:32:52,649 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:32:52,663 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:32:52,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:32:52,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:32:52,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:32:52,664 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:32:52,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:32:52,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:32:52,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:32:52,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:32:52,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:32:52,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:32:52,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:32:52,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:32:52,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:32:52,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:32:52,667 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:32:52,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:32:52,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:32:52,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:32:52,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:32:52,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:32:52,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:32:52,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:32:52,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:32:52,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:32:52,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:32:52,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:32:52,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:32:52,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:32:52,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:32:52,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:32:52,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:32:52,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:32:52,940 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:32:52,940 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-18 18:32:53,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cca24a1/c28d22daac1d4fbbad3a03f91d7214e7/FLAGb06b0b081 [2019-12-18 18:32:53,584 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:32:53,585 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2019-12-18 18:32:53,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cca24a1/c28d22daac1d4fbbad3a03f91d7214e7/FLAGb06b0b081 [2019-12-18 18:32:53,835 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1cca24a1/c28d22daac1d4fbbad3a03f91d7214e7 [2019-12-18 18:32:53,845 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:32:53,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:32:53,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:53,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:32:53,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:32:53,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:53" (1/1) ... [2019-12-18 18:32:53,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:53, skipping insertion in model container [2019-12-18 18:32:53,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:32:53" (1/1) ... [2019-12-18 18:32:53,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:32:53,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:32:54,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:54,466 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:32:54,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:32:54,608 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:32:54,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54 WrapperNode [2019-12-18 18:32:54,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:32:54,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:54,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:32:54,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:32:54,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:32:54,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:32:54,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:32:54,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:32:54,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,695 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (1/1) ... [2019-12-18 18:32:54,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:32:54,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:32:54,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:32:54,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:32:54,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (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 18:32:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:32:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:32:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:32:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:32:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:32:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:32:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:32:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:32:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:32:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:32:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:32:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:32:54,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:32:54,795 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 18:32:55,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:32:55,593 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:32:55,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:55 BoogieIcfgContainer [2019-12-18 18:32:55,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:32:55,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:32:55,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:32:55,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:32:55,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:32:53" (1/3) ... [2019-12-18 18:32:55,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77958c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:55, skipping insertion in model container [2019-12-18 18:32:55,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:32:54" (2/3) ... [2019-12-18 18:32:55,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77958c83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:32:55, skipping insertion in model container [2019-12-18 18:32:55,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:32:55" (3/3) ... [2019-12-18 18:32:55,603 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2019-12-18 18:32:55,612 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:32:55,612 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:32:55,620 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:32:55,622 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:32:55,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,679 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,679 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,680 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,704 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,709 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,718 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,719 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,723 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,724 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:32:55,740 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:32:55,761 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:32:55,762 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:32:55,762 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:32:55,762 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:32:55,762 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:32:55,762 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:32:55,762 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:32:55,763 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:32:55,780 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 18:32:55,782 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:32:55,872 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:32:55,873 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:55,892 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:32:55,917 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:32:55,968 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:32:55,968 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:32:55,982 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:32:56,001 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 18:32:56,003 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:33:01,323 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:33:01,442 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:33:01,470 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-18 18:33:01,470 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 18:33:01,474 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-18 18:33:16,539 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-18 18:33:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-18 18:33:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:33:16,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:33:16,550 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:33:16,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:33:16,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:33:16,555 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-18 18:33:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:33:16,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388936286] [2019-12-18 18:33:16,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:33:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:33:16,852 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 18:33:16,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388936286] [2019-12-18 18:33:16,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:33:16,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:33:16,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867608380] [2019-12-18 18:33:16,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:33:16,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:33:16,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:33:16,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:33:16,883 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-18 18:33:20,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:33:20,448 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-18 18:33:20,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:33:20,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:33:20,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:33:21,236 INFO L225 Difference]: With dead ends: 104560 [2019-12-18 18:33:21,236 INFO L226 Difference]: Without dead ends: 102376 [2019-12-18 18:33:21,238 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 18:33:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-18 18:33:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-18 18:33:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-18 18:33:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-18 18:33:31,154 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-18 18:33:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:33:31,154 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-18 18:33:31,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:33:31,154 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-18 18:33:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:33:31,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:33:31,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:33:31,159 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:33:31,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:33:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-18 18:33:31,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:33:31,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415055741] [2019-12-18 18:33:31,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:33:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:33:31,290 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 18:33:31,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415055741] [2019-12-18 18:33:31,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:33:31,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:33:31,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147133414] [2019-12-18 18:33:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:33:31,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:33:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:33:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:33:31,296 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-18 18:33:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:33:36,461 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-18 18:33:36,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:33:36,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:33:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:33:37,220 INFO L225 Difference]: With dead ends: 164490 [2019-12-18 18:33:37,220 INFO L226 Difference]: Without dead ends: 164441 [2019-12-18 18:33:37,221 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 18:33:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-18 18:33:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-18 18:33:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-18 18:33:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-18 18:33:45,326 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-18 18:33:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:33:45,327 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-18 18:33:45,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:33:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-18 18:33:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:33:45,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:33:45,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:33:45,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:33:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:33:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-18 18:33:45,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:33:45,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661515636] [2019-12-18 18:33:45,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:33:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:33:45,423 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 18:33:45,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661515636] [2019-12-18 18:33:45,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:33:45,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:33:45,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439391130] [2019-12-18 18:33:45,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:33:45,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:33:45,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:33:45,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:33:45,427 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-18 18:33:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:33:51,478 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-18 18:33:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:33:51,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:33:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:33:52,656 INFO L225 Difference]: With dead ends: 211896 [2019-12-18 18:33:52,656 INFO L226 Difference]: Without dead ends: 211833 [2019-12-18 18:33:52,656 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 18:33:58,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-18 18:34:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-18 18:34:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-18 18:34:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-18 18:34:02,864 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-18 18:34:02,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:02,865 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-18 18:34:02,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:34:02,865 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-18 18:34:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:34:02,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:02,869 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:02,869 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-18 18:34:02,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:02,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102086238] [2019-12-18 18:34:02,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:02,919 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 18:34:02,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102086238] [2019-12-18 18:34:02,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:02,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:02,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941966915] [2019-12-18 18:34:02,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:02,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:02,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:02,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:02,921 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-18 18:34:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:03,055 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-18 18:34:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:03,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:34:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:03,155 INFO L225 Difference]: With dead ends: 36088 [2019-12-18 18:34:03,155 INFO L226 Difference]: Without dead ends: 36088 [2019-12-18 18:34:03,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-18 18:34:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-18 18:34:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-18 18:34:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-18 18:34:09,345 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-18 18:34:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:09,346 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-18 18:34:09,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-18 18:34:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:34:09,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:09,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:09,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:09,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-18 18:34:09,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:09,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100362146] [2019-12-18 18:34:09,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:09,527 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 18:34:09,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100362146] [2019-12-18 18:34:09,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:09,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:34:09,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490420946] [2019-12-18 18:34:09,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:34:09,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:34:09,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:34:09,530 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 6 states. [2019-12-18 18:34:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:10,575 INFO L93 Difference]: Finished difference Result 50098 states and 158333 transitions. [2019-12-18 18:34:10,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:34:10,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-18 18:34:10,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:10,684 INFO L225 Difference]: With dead ends: 50098 [2019-12-18 18:34:10,684 INFO L226 Difference]: Without dead ends: 50091 [2019-12-18 18:34:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:34:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50091 states. [2019-12-18 18:34:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50091 to 36331. [2019-12-18 18:34:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36331 states. [2019-12-18 18:34:11,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36331 states to 36331 states and 118099 transitions. [2019-12-18 18:34:11,766 INFO L78 Accepts]: Start accepts. Automaton has 36331 states and 118099 transitions. Word has length 19 [2019-12-18 18:34:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:11,766 INFO L462 AbstractCegarLoop]: Abstraction has 36331 states and 118099 transitions. [2019-12-18 18:34:11,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:34:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36331 states and 118099 transitions. [2019-12-18 18:34:11,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:34:11,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:11,772 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:11,772 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:11,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:11,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1843003519, now seen corresponding path program 2 times [2019-12-18 18:34:11,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:11,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300335794] [2019-12-18 18:34:11,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:11,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300335794] [2019-12-18 18:34:11,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:11,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:11,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788626413] [2019-12-18 18:34:11,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:11,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:11,862 INFO L87 Difference]: Start difference. First operand 36331 states and 118099 transitions. Second operand 5 states. [2019-12-18 18:34:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:12,544 INFO L93 Difference]: Finished difference Result 46087 states and 147024 transitions. [2019-12-18 18:34:12,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:34:12,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:34:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:12,628 INFO L225 Difference]: With dead ends: 46087 [2019-12-18 18:34:12,629 INFO L226 Difference]: Without dead ends: 46080 [2019-12-18 18:34:12,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:34:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46080 states. [2019-12-18 18:34:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46080 to 36431. [2019-12-18 18:34:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-18 18:34:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-18 18:34:13,294 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-18 18:34:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:13,294 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-18 18:34:13,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-18 18:34:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:34:13,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:13,790 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 18:34:13,790 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:13,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-18 18:34:13,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:13,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32029333] [2019-12-18 18:34:13,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:13,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32029333] [2019-12-18 18:34:13,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:13,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:13,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087340048] [2019-12-18 18:34:13,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:34:13,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:34:13,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:13,847 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-18 18:34:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:13,887 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-18 18:34:13,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:34:13,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:34:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:13,899 INFO L225 Difference]: With dead ends: 7050 [2019-12-18 18:34:13,900 INFO L226 Difference]: Without dead ends: 7050 [2019-12-18 18:34:13,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-18 18:34:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-18 18:34:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-18 18:34:14,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-18 18:34:14,004 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-18 18:34:14,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:14,004 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-18 18:34:14,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:34:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-18 18:34:14,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:34:14,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:14,012 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] [2019-12-18 18:34:14,012 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-18 18:34:14,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:14,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8690959] [2019-12-18 18:34:14,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:14,090 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 18:34:14,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8690959] [2019-12-18 18:34:14,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:14,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:34:14,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891396976] [2019-12-18 18:34:14,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:14,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:14,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:14,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:14,094 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-18 18:34:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:14,131 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-18 18:34:14,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:34:14,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:34:14,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:14,140 INFO L225 Difference]: With dead ends: 5023 [2019-12-18 18:34:14,140 INFO L226 Difference]: Without dead ends: 5023 [2019-12-18 18:34:14,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-18 18:34:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-18 18:34:14,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-18 18:34:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-18 18:34:14,209 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-18 18:34:14,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:14,210 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-18 18:34:14,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:14,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-18 18:34:14,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:14,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:14,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:14,219 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:14,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:14,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-18 18:34:14,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:14,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970307780] [2019-12-18 18:34:14,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:14,294 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 18:34:14,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970307780] [2019-12-18 18:34:14,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:14,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:14,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164868135] [2019-12-18 18:34:14,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:14,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:14,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:14,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:14,296 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-18 18:34:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:14,349 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-18 18:34:14,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:14,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:14,355 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 18:34:14,356 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 18:34:14,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 18:34:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 18:34:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 18:34:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-18 18:34:14,418 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-18 18:34:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:14,419 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-18 18:34:14,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-18 18:34:14,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:14,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:14,428 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:14,428 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:14,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:14,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-18 18:34:14,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:14,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997790142] [2019-12-18 18:34:14,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:14,494 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 18:34:14,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997790142] [2019-12-18 18:34:14,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:14,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:14,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236782572] [2019-12-18 18:34:14,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:14,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:14,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:14,496 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-18 18:34:14,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:14,559 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-18 18:34:14,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:14,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:14,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:14,568 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 18:34:14,569 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 18:34:14,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 18:34:14,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 18:34:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 18:34:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-18 18:34:14,656 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-18 18:34:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:14,657 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-18 18:34:14,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-18 18:34:14,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:14,667 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:14,667 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:14,667 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-18 18:34:14,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:14,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139714700] [2019-12-18 18:34:14,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:14,804 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 18:34:14,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139714700] [2019-12-18 18:34:14,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:14,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:34:14,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134337004] [2019-12-18 18:34:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:14,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:14,807 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-18 18:34:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:15,117 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-18 18:34:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:34:15,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:34:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:15,130 INFO L225 Difference]: With dead ends: 7088 [2019-12-18 18:34:15,131 INFO L226 Difference]: Without dead ends: 7088 [2019-12-18 18:34:15,131 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 18:34:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-18 18:34:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-18 18:34:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-18 18:34:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-18 18:34:15,249 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-18 18:34:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:15,249 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-18 18:34:15,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-18 18:34:15,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:15,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:15,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:15,258 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-18 18:34:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:15,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426063006] [2019-12-18 18:34:15,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:15,360 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 18:34:15,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426063006] [2019-12-18 18:34:15,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:15,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:34:15,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287867325] [2019-12-18 18:34:15,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:15,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:15,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:15,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:15,362 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-18 18:34:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:15,685 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-18 18:34:15,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:34:15,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:34:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:15,699 INFO L225 Difference]: With dead ends: 9067 [2019-12-18 18:34:15,699 INFO L226 Difference]: Without dead ends: 9067 [2019-12-18 18:34:15,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:34:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-18 18:34:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-18 18:34:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-18 18:34:15,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-18 18:34:15,807 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-18 18:34:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:15,808 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-18 18:34:15,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-18 18:34:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:15,818 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:15,818 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:15,819 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-18 18:34:15,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:15,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067057412] [2019-12-18 18:34:15,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:15,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:15,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067057412] [2019-12-18 18:34:15,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:15,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:34:15,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173577213] [2019-12-18 18:34:15,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:34:15,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:34:15,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:34:15,902 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-18 18:34:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:16,495 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-18 18:34:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:34:16,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 18:34:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:16,512 INFO L225 Difference]: With dead ends: 10883 [2019-12-18 18:34:16,513 INFO L226 Difference]: Without dead ends: 10883 [2019-12-18 18:34:16,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:34:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-18 18:34:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-18 18:34:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-18 18:34:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-18 18:34:16,680 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-18 18:34:16,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:16,680 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-18 18:34:16,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:34:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-18 18:34:16,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:16,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:16,690 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:16,691 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:16,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-18 18:34:16,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:16,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94807479] [2019-12-18 18:34:16,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:16,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:16,792 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 18:34:16,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94807479] [2019-12-18 18:34:16,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:16,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:34:16,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772003727] [2019-12-18 18:34:16,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:34:16,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:16,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:34:16,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:34:16,794 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 7 states. [2019-12-18 18:34:17,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:17,801 INFO L93 Difference]: Finished difference Result 11106 states and 31910 transitions. [2019-12-18 18:34:17,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 18:34:17,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:34:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:17,816 INFO L225 Difference]: With dead ends: 11106 [2019-12-18 18:34:17,816 INFO L226 Difference]: Without dead ends: 11106 [2019-12-18 18:34:17,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 18:34:17,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11106 states. [2019-12-18 18:34:17,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11106 to 6997. [2019-12-18 18:34:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6997 states. [2019-12-18 18:34:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6997 states to 6997 states and 20313 transitions. [2019-12-18 18:34:17,933 INFO L78 Accepts]: Start accepts. Automaton has 6997 states and 20313 transitions. Word has length 65 [2019-12-18 18:34:17,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:17,933 INFO L462 AbstractCegarLoop]: Abstraction has 6997 states and 20313 transitions. [2019-12-18 18:34:17,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:34:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6997 states and 20313 transitions. [2019-12-18 18:34:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:17,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:17,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:17,943 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:17,943 INFO L82 PathProgramCache]: Analyzing trace with hash 695487673, now seen corresponding path program 5 times [2019-12-18 18:34:17,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:17,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335471585] [2019-12-18 18:34:17,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:18,051 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 18:34:18,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335471585] [2019-12-18 18:34:18,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:18,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:34:18,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056299401] [2019-12-18 18:34:18,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:34:18,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:18,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:34:18,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:34:18,054 INFO L87 Difference]: Start difference. First operand 6997 states and 20313 transitions. Second operand 6 states. [2019-12-18 18:34:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:18,142 INFO L93 Difference]: Finished difference Result 12035 states and 34990 transitions. [2019-12-18 18:34:18,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:34:18,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 18:34:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:18,154 INFO L225 Difference]: With dead ends: 12035 [2019-12-18 18:34:18,154 INFO L226 Difference]: Without dead ends: 6579 [2019-12-18 18:34:18,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:34:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6579 states. [2019-12-18 18:34:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6579 to 6579. [2019-12-18 18:34:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6579 states. [2019-12-18 18:34:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6579 states to 6579 states and 19079 transitions. [2019-12-18 18:34:18,296 INFO L78 Accepts]: Start accepts. Automaton has 6579 states and 19079 transitions. Word has length 65 [2019-12-18 18:34:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:18,297 INFO L462 AbstractCegarLoop]: Abstraction has 6579 states and 19079 transitions. [2019-12-18 18:34:18,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:34:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6579 states and 19079 transitions. [2019-12-18 18:34:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:18,314 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:18,314 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:18,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1304907827, now seen corresponding path program 6 times [2019-12-18 18:34:18,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:18,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33712021] [2019-12-18 18:34:18,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:18,433 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 18:34:18,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33712021] [2019-12-18 18:34:18,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:18,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:34:18,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007236704] [2019-12-18 18:34:18,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:34:18,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:34:18,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:34:18,438 INFO L87 Difference]: Start difference. First operand 6579 states and 19079 transitions. Second operand 6 states. [2019-12-18 18:34:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:19,016 INFO L93 Difference]: Finished difference Result 9537 states and 27106 transitions. [2019-12-18 18:34:19,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:34:19,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 18:34:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:19,032 INFO L225 Difference]: With dead ends: 9537 [2019-12-18 18:34:19,032 INFO L226 Difference]: Without dead ends: 9537 [2019-12-18 18:34:19,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:34:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2019-12-18 18:34:19,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 6860. [2019-12-18 18:34:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6860 states. [2019-12-18 18:34:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6860 states to 6860 states and 19878 transitions. [2019-12-18 18:34:19,189 INFO L78 Accepts]: Start accepts. Automaton has 6860 states and 19878 transitions. Word has length 65 [2019-12-18 18:34:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:19,190 INFO L462 AbstractCegarLoop]: Abstraction has 6860 states and 19878 transitions. [2019-12-18 18:34:19,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:34:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 6860 states and 19878 transitions. [2019-12-18 18:34:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:19,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:19,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:19,200 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -338304105, now seen corresponding path program 7 times [2019-12-18 18:34:19,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:19,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775651763] [2019-12-18 18:34:19,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:19,334 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 18:34:19,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775651763] [2019-12-18 18:34:19,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:19,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 18:34:19,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757334054] [2019-12-18 18:34:19,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:34:19,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:19,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:34:19,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:34:19,337 INFO L87 Difference]: Start difference. First operand 6860 states and 19878 transitions. Second operand 7 states. [2019-12-18 18:34:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:20,335 INFO L93 Difference]: Finished difference Result 10605 states and 30155 transitions. [2019-12-18 18:34:20,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 18:34:20,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 18:34:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:20,349 INFO L225 Difference]: With dead ends: 10605 [2019-12-18 18:34:20,349 INFO L226 Difference]: Without dead ends: 10605 [2019-12-18 18:34:20,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2019-12-18 18:34:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10605 states. [2019-12-18 18:34:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10605 to 7315. [2019-12-18 18:34:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7315 states. [2019-12-18 18:34:20,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7315 states to 7315 states and 21208 transitions. [2019-12-18 18:34:20,464 INFO L78 Accepts]: Start accepts. Automaton has 7315 states and 21208 transitions. Word has length 65 [2019-12-18 18:34:20,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:20,465 INFO L462 AbstractCegarLoop]: Abstraction has 7315 states and 21208 transitions. [2019-12-18 18:34:20,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:34:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 7315 states and 21208 transitions. [2019-12-18 18:34:20,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:20,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:20,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:20,472 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:20,473 INFO L82 PathProgramCache]: Analyzing trace with hash 882387211, now seen corresponding path program 8 times [2019-12-18 18:34:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:20,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207538341] [2019-12-18 18:34:20,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:20,541 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 18:34:20,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207538341] [2019-12-18 18:34:20,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:20,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:20,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677683888] [2019-12-18 18:34:20,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:20,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:20,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:20,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:20,543 INFO L87 Difference]: Start difference. First operand 7315 states and 21208 transitions. Second operand 3 states. [2019-12-18 18:34:20,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:20,603 INFO L93 Difference]: Finished difference Result 7315 states and 21207 transitions. [2019-12-18 18:34:20,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:20,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:20,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:20,614 INFO L225 Difference]: With dead ends: 7315 [2019-12-18 18:34:20,614 INFO L226 Difference]: Without dead ends: 7315 [2019-12-18 18:34:20,615 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 18:34:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7315 states. [2019-12-18 18:34:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7315 to 4341. [2019-12-18 18:34:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4341 states. [2019-12-18 18:34:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4341 states to 4341 states and 12859 transitions. [2019-12-18 18:34:20,716 INFO L78 Accepts]: Start accepts. Automaton has 4341 states and 12859 transitions. Word has length 65 [2019-12-18 18:34:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:20,716 INFO L462 AbstractCegarLoop]: Abstraction has 4341 states and 12859 transitions. [2019-12-18 18:34:20,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 4341 states and 12859 transitions. [2019-12-18 18:34:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:34:20,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:20,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:20,721 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:20,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:20,721 INFO L82 PathProgramCache]: Analyzing trace with hash 662541241, now seen corresponding path program 1 times [2019-12-18 18:34:20,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:20,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861492292] [2019-12-18 18:34:20,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:20,837 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 18:34:20,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861492292] [2019-12-18 18:34:20,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:20,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739643516] [2019-12-18 18:34:20,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:20,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:20,839 INFO L87 Difference]: Start difference. First operand 4341 states and 12859 transitions. Second operand 3 states. [2019-12-18 18:34:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:20,861 INFO L93 Difference]: Finished difference Result 3931 states and 11304 transitions. [2019-12-18 18:34:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:20,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:34:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:20,867 INFO L225 Difference]: With dead ends: 3931 [2019-12-18 18:34:20,867 INFO L226 Difference]: Without dead ends: 3931 [2019-12-18 18:34:20,868 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 18:34:20,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2019-12-18 18:34:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3708. [2019-12-18 18:34:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3708 states. [2019-12-18 18:34:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 10669 transitions. [2019-12-18 18:34:20,925 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 10669 transitions. Word has length 66 [2019-12-18 18:34:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:20,925 INFO L462 AbstractCegarLoop]: Abstraction has 3708 states and 10669 transitions. [2019-12-18 18:34:20,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 10669 transitions. [2019-12-18 18:34:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:34:20,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:20,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:20,929 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:20,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:20,929 INFO L82 PathProgramCache]: Analyzing trace with hash 897051641, now seen corresponding path program 1 times [2019-12-18 18:34:20,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:20,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571459538] [2019-12-18 18:34:20,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:20,983 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 18:34:20,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571459538] [2019-12-18 18:34:20,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:20,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:20,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324984903] [2019-12-18 18:34:20,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:20,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:20,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:20,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:20,986 INFO L87 Difference]: Start difference. First operand 3708 states and 10669 transitions. Second operand 3 states. [2019-12-18 18:34:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:21,005 INFO L93 Difference]: Finished difference Result 3508 states and 9871 transitions. [2019-12-18 18:34:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:21,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:34:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:21,010 INFO L225 Difference]: With dead ends: 3508 [2019-12-18 18:34:21,010 INFO L226 Difference]: Without dead ends: 3508 [2019-12-18 18:34:21,010 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 18:34:21,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-12-18 18:34:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 2815. [2019-12-18 18:34:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2815 states. [2019-12-18 18:34:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2815 states to 2815 states and 7936 transitions. [2019-12-18 18:34:21,068 INFO L78 Accepts]: Start accepts. Automaton has 2815 states and 7936 transitions. Word has length 67 [2019-12-18 18:34:21,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:21,068 INFO L462 AbstractCegarLoop]: Abstraction has 2815 states and 7936 transitions. [2019-12-18 18:34:21,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:21,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2815 states and 7936 transitions. [2019-12-18 18:34:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:21,072 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:21,072 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:21,073 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-18 18:34:21,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:21,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671552972] [2019-12-18 18:34:21,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:21,391 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 18:34:21,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671552972] [2019-12-18 18:34:21,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:21,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 18:34:21,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679158844] [2019-12-18 18:34:21,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 18:34:21,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:21,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 18:34:21,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-18 18:34:21,395 INFO L87 Difference]: Start difference. First operand 2815 states and 7936 transitions. Second operand 15 states. [2019-12-18 18:34:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:22,504 INFO L93 Difference]: Finished difference Result 5018 states and 13954 transitions. [2019-12-18 18:34:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 18:34:22,505 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 18:34:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:22,513 INFO L225 Difference]: With dead ends: 5018 [2019-12-18 18:34:22,513 INFO L226 Difference]: Without dead ends: 4988 [2019-12-18 18:34:22,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 18:34:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2019-12-18 18:34:22,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4067. [2019-12-18 18:34:22,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-18 18:34:22,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-18 18:34:22,574 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-18 18:34:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:22,574 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-18 18:34:22,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 18:34:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-18 18:34:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:22,580 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:22,580 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:22,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:22,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 2 times [2019-12-18 18:34:22,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:22,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505348876] [2019-12-18 18:34:22,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:34:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:34:22,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:34:22,699 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:34:22,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2031~0.base_21|) |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0)) |v_#memory_int_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2031~0.base_21|) (= v_~z$read_delayed_var~0.offset_7 0) (= |v_ULTIMATE.start_main_~#t2031~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= (select .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21|) 0) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2031~0.base_21| 4)) (= (store .cse0 |v_ULTIMATE.start_main_~#t2031~0.base_21| 1) |v_#valid_53|) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_20|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ULTIMATE.start_main_~#t2031~0.offset=|v_ULTIMATE.start_main_~#t2031~0.offset_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_17|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_~#t2031~0.base=|v_ULTIMATE.start_main_~#t2031~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2032~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2031~0.offset, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2033~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2032~0.offset, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t2031~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:34:22,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2032~0.base_12|) |v_ULTIMATE.start_main_~#t2032~0.offset_11| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2032~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t2032~0.base_12|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2032~0.base_12| 4)) (= |v_ULTIMATE.start_main_~#t2032~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2032~0.base=|v_ULTIMATE.start_main_~#t2032~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2032~0.offset=|v_ULTIMATE.start_main_~#t2032~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2032~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2032~0.offset] because there is no mapped edge [2019-12-18 18:34:22,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 18:34:22,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2033~0.base_9|) |v_ULTIMATE.start_main_~#t2033~0.offset_8| 2))) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2033~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9|) 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2033~0.base_9| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2033~0.base_9| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2033~0.base_9|)) (= |v_ULTIMATE.start_main_~#t2033~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2033~0.base=|v_ULTIMATE.start_main_~#t2033~0.base_9|, ULTIMATE.start_main_~#t2033~0.offset=|v_ULTIMATE.start_main_~#t2033~0.offset_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2033~0.base, ULTIMATE.start_main_~#t2033~0.offset] because there is no mapped edge [2019-12-18 18:34:22,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1175737219 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-1175737219 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1175737219 |P0Thread1of1ForFork0_#t~ite5_Out-1175737219|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1175737219|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1175737219, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1175737219} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1175737219|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1175737219, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1175737219} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:34:22,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1455625829 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1455625829 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1455625829 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1455625829 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out1455625829| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1455625829 |P0Thread1of1ForFork0_#t~ite6_Out1455625829|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1455625829, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1455625829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455625829, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1455625829} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1455625829|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1455625829, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1455625829, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1455625829, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1455625829} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:34:22,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In814383840 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In814383840 256)))) (or (and (= ~z$r_buff0_thd1~0_In814383840 ~z$r_buff0_thd1~0_Out814383840) (or .cse0 .cse1)) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out814383840 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In814383840, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In814383840} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In814383840, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out814383840|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out814383840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:34:22,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-144619661 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-144619661 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-144619661 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-144619661 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-144619661|)) (and (= ~z$r_buff1_thd1~0_In-144619661 |P0Thread1of1ForFork0_#t~ite8_Out-144619661|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-144619661, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-144619661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-144619661, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144619661} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-144619661, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-144619661|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-144619661, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-144619661, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144619661} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:34:22,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:34:22,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-1490306030| |P1Thread1of1ForFork1_#t~ite10_Out-1490306030|)) (.cse0 (= (mod ~z$w_buff1_used~0_In-1490306030 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1490306030 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z~0_In-1490306030 |P1Thread1of1ForFork1_#t~ite9_Out-1490306030|)) (and (= ~z$w_buff1~0_In-1490306030 |P1Thread1of1ForFork1_#t~ite9_Out-1490306030|) .cse2 (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1490306030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1490306030, ~z$w_buff1~0=~z$w_buff1~0_In-1490306030, ~z~0=~z~0_In-1490306030} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1490306030|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1490306030, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1490306030, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-1490306030|, ~z$w_buff1~0=~z$w_buff1~0_In-1490306030, ~z~0=~z~0_In-1490306030} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 18:34:22,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In925672127 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In925672127 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out925672127| ~z~0_In925672127) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out925672127| ~z$w_buff1~0_In925672127)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In925672127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In925672127, ~z$w_buff1~0=~z$w_buff1~0_In925672127, ~z~0=~z~0_In925672127} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out925672127|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In925672127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In925672127, ~z$w_buff1~0=~z$w_buff1~0_In925672127, ~z~0=~z~0_In925672127} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:34:22,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 18:34:22,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1557471953 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1557471953 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1557471953| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out1557471953| ~z$w_buff0_used~0_In1557471953) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1557471953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557471953} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1557471953, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1557471953, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1557471953|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:34:22,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1890721979 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In1890721979 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1890721979 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In1890721979 256) 0))) (or (and (= ~z$w_buff1_used~0_In1890721979 |P2Thread1of1ForFork2_#t~ite18_Out1890721979|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out1890721979| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1890721979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1890721979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890721979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1890721979} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1890721979, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1890721979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1890721979, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1890721979, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1890721979|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:34:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-107218332 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-107218332 256)))) (or (and (= ~z$r_buff0_thd3~0_In-107218332 |P2Thread1of1ForFork2_#t~ite19_Out-107218332|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-107218332|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-107218332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-107218332} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-107218332, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-107218332, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-107218332|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:34:22,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1821480581 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1821480581 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1821480581 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1821480581 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1821480581| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite20_Out-1821480581| ~z$r_buff1_thd3~0_In-1821480581)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1821480581, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1821480581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1821480581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1821480581} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1821480581, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1821480581|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1821480581, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1821480581, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1821480581} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:34:22,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:34:22,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1938801851 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1938801851 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out1938801851|)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out1938801851| ~z$w_buff0_used~0_In1938801851) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1938801851, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1938801851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1938801851, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1938801851|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1938801851} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:34:22,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In725270058 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In725270058 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In725270058 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In725270058 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In725270058 |P1Thread1of1ForFork1_#t~ite12_Out725270058|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out725270058| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In725270058, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In725270058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In725270058, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In725270058} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In725270058, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In725270058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In725270058, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out725270058|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In725270058} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:34:22,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1714845373 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1714845373 256)))) (or (and (= ~z$r_buff0_thd2~0_In1714845373 |P1Thread1of1ForFork1_#t~ite13_Out1714845373|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1714845373|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1714845373, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1714845373} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1714845373, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1714845373|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1714845373} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:34:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In-1122558343 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1122558343 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-1122558343 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1122558343 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite14_Out-1122558343| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~z$r_buff1_thd2~0_In-1122558343 |P1Thread1of1ForFork1_#t~ite14_Out-1122558343|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1122558343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1122558343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1122558343, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1122558343} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1122558343, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1122558343, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1122558343, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1122558343|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1122558343} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:34:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:34:22,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:34:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite24_Out1794474442| |ULTIMATE.start_main_#t~ite25_Out1794474442|)) (.cse0 (= (mod ~z$w_buff1_used~0_In1794474442 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1794474442 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out1794474442| ~z$w_buff1~0_In1794474442) (not .cse0) .cse1 (not .cse2)) (and (= |ULTIMATE.start_main_#t~ite24_Out1794474442| ~z~0_In1794474442) .cse1 (or .cse0 .cse2)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794474442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794474442, ~z$w_buff1~0=~z$w_buff1~0_In1794474442, ~z~0=~z~0_In1794474442} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1794474442, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1794474442|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1794474442, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1794474442|, ~z$w_buff1~0=~z$w_buff1~0_In1794474442, ~z~0=~z~0_In1794474442} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:34:22,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-1584112038 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1584112038 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out-1584112038|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1584112038 |ULTIMATE.start_main_#t~ite26_Out-1584112038|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584112038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584112038} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1584112038, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1584112038, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1584112038|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:34:22,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-520381515 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-520381515 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-520381515 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-520381515 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-520381515|)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-520381515 |ULTIMATE.start_main_#t~ite27_Out-520381515|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520381515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520381515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520381515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520381515} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-520381515, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-520381515, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-520381515, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-520381515, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-520381515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:34:22,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-359973723 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-359973723 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out-359973723| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out-359973723| ~z$r_buff0_thd0~0_In-359973723) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-359973723, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-359973723} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-359973723, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-359973723|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-359973723} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:34:22,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1469720762 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1469720762 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1469720762 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1469720762 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out1469720762| ~z$r_buff1_thd0~0_In1469720762)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out1469720762| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1469720762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1469720762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1469720762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1469720762} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1469720762, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1469720762|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1469720762, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1469720762, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1469720762} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:34:22,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:34:22,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:34:22,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:34:22,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:34:22 BasicIcfg [2019-12-18 18:34:22,834 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:34:22,836 INFO L168 Benchmark]: Toolchain (without parser) took 88989.18 ms. Allocated memory was 138.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 100.7 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,836 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.38 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 157.0 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 153.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,838 INFO L168 Benchmark]: Boogie Preprocessor took 40.72 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,839 INFO L168 Benchmark]: RCFGBuilder took 875.29 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.2 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,839 INFO L168 Benchmark]: TraceAbstraction took 87237.84 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 18:34:22,846 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.42 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 761.38 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 100.5 MB in the beginning and 157.0 MB in the end (delta: -56.5 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.28 ms. Allocated memory is still 202.9 MB. Free memory was 157.0 MB in the beginning and 153.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.72 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 875.29 ms. Allocated memory is still 202.9 MB. Free memory was 151.0 MB in the beginning and 101.2 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 87237.84 ms. Allocated memory was 202.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.2 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.6s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.9s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 25.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3571 SDtfs, 2897 SDslu, 7391 SDs, 0 SdLazy, 4963 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 50 SyntacticMatches, 17 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred 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: 37.6s AutomataMinimizationTime, 21 MinimizatonAttempts, 95432 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1059 NumberOfCodeBlocks, 1059 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 970 ConstructedInterpolants, 0 QuantifiedInterpolants, 172817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...