/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/mix024_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 01:54:46,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 01:54:46,526 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 01:54:46,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 01:54:46,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 01:54:46,548 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 01:54:46,550 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 01:54:46,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 01:54:46,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 01:54:46,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 01:54:46,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 01:54:46,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 01:54:46,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 01:54:46,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 01:54:46,576 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 01:54:46,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 01:54:46,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 01:54:46,579 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 01:54:46,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 01:54:46,586 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 01:54:46,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 01:54:46,594 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 01:54:46,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 01:54:46,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 01:54:46,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 01:54:46,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 01:54:46,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 01:54:46,601 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 01:54:46,602 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 01:54:46,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 01:54:46,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 01:54:46,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 01:54:46,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 01:54:46,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 01:54:46,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 01:54:46,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 01:54:46,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 01:54:46,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 01:54:46,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 01:54:46,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 01:54:46,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 01:54:46,615 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-27 01:54:46,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 01:54:46,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 01:54:46,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 01:54:46,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 01:54:46,654 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 01:54:46,654 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 01:54:46,654 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 01:54:46,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 01:54:46,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 01:54:46,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 01:54:46,655 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 01:54:46,655 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 01:54:46,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 01:54:46,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 01:54:46,656 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 01:54:46,656 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 01:54:46,656 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 01:54:46,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 01:54:46,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 01:54:46,657 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 01:54:46,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 01:54:46,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 01:54:46,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 01:54:46,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 01:54:46,659 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 01:54:46,659 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 01:54:46,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 01:54:46,660 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 01:54:46,660 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 01:54:46,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 01:54:46,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 01:54:46,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 01:54:46,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 01:54:46,980 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 01:54:46,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 01:54:47,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9198ad58/11459efdd08d46539df74f522b5d7a1d/FLAGcd8165a23 [2019-12-27 01:54:47,582 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 01:54:47,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.opt.i [2019-12-27 01:54:47,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9198ad58/11459efdd08d46539df74f522b5d7a1d/FLAGcd8165a23 [2019-12-27 01:54:47,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9198ad58/11459efdd08d46539df74f522b5d7a1d [2019-12-27 01:54:47,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 01:54:47,943 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 01:54:47,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 01:54:47,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 01:54:47,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 01:54:47,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:54:47" (1/1) ... [2019-12-27 01:54:47,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd8673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:47, skipping insertion in model container [2019-12-27 01:54:47,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 01:54:47" (1/1) ... [2019-12-27 01:54:47,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 01:54:48,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 01:54:48,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:54:48,606 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 01:54:48,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 01:54:48,767 INFO L208 MainTranslator]: Completed translation [2019-12-27 01:54:48,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48 WrapperNode [2019-12-27 01:54:48,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 01:54:48,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 01:54:48,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 01:54:48,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 01:54:48,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 01:54:48,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 01:54:48,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 01:54:48,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 01:54:48,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,876 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (1/1) ... [2019-12-27 01:54:48,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 01:54:48,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 01:54:48,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 01:54:48,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 01:54:48,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (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-27 01:54:48,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 01:54:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 01:54:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 01:54:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 01:54:48,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 01:54:48,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 01:54:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 01:54:48,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 01:54:48,965 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 01:54:48,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 01:54:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 01:54:48,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 01:54:48,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 01:54:48,968 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 01:54:49,706 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 01:54:49,706 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 01:54:49,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:54:49 BoogieIcfgContainer [2019-12-27 01:54:49,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 01:54:49,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 01:54:49,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 01:54:49,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 01:54:49,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 01:54:47" (1/3) ... [2019-12-27 01:54:49,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a3b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:54:49, skipping insertion in model container [2019-12-27 01:54:49,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 01:54:48" (2/3) ... [2019-12-27 01:54:49,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a3b5f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 01:54:49, skipping insertion in model container [2019-12-27 01:54:49,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 01:54:49" (3/3) ... [2019-12-27 01:54:49,723 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_pso.opt.i [2019-12-27 01:54:49,734 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 01:54:49,734 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 01:54:49,752 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 01:54:49,753 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 01:54:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,824 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,871 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,872 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,885 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,900 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,901 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,901 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,903 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,905 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,906 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,907 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,912 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,918 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,919 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 01:54:49,934 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 01:54:49,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 01:54:49,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 01:54:49,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 01:54:49,952 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 01:54:49,952 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 01:54:49,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 01:54:49,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 01:54:49,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 01:54:49,969 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 197 transitions [2019-12-27 01:54:49,971 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 01:54:50,078 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 01:54:50,078 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:54:50,096 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:54:50,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 166 places, 197 transitions [2019-12-27 01:54:50,176 INFO L132 PetriNetUnfolder]: 41/194 cut-off events. [2019-12-27 01:54:50,176 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 01:54:50,185 INFO L76 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 41/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 446 event pairs. 0/151 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 01:54:50,206 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 01:54:50,207 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 01:54:55,908 WARN L192 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 01:54:56,042 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 01:54:56,069 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74173 [2019-12-27 01:54:56,074 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 01:54:56,077 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 90 transitions [2019-12-27 01:55:05,918 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 82802 states. [2019-12-27 01:55:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 82802 states. [2019-12-27 01:55:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 01:55:05,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:05,927 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 01:55:05,927 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:05,932 INFO L82 PathProgramCache]: Analyzing trace with hash 803939489, now seen corresponding path program 1 times [2019-12-27 01:55:05,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:05,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001361742] [2019-12-27 01:55:05,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:06,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:06,164 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-27 01:55:06,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001361742] [2019-12-27 01:55:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:06,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 01:55:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822384221] [2019-12-27 01:55:06,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:06,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:06,191 INFO L87 Difference]: Start difference. First operand 82802 states. Second operand 3 states. [2019-12-27 01:55:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:07,036 INFO L93 Difference]: Finished difference Result 81762 states and 350164 transitions. [2019-12-27 01:55:07,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:07,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 01:55:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:09,750 INFO L225 Difference]: With dead ends: 81762 [2019-12-27 01:55:09,750 INFO L226 Difference]: Without dead ends: 77082 [2019-12-27 01:55:09,752 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-27 01:55:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77082 states. [2019-12-27 01:55:14,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77082 to 77082. [2019-12-27 01:55:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77082 states. [2019-12-27 01:55:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77082 states to 77082 states and 329650 transitions. [2019-12-27 01:55:15,175 INFO L78 Accepts]: Start accepts. Automaton has 77082 states and 329650 transitions. Word has length 5 [2019-12-27 01:55:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:15,176 INFO L462 AbstractCegarLoop]: Abstraction has 77082 states and 329650 transitions. [2019-12-27 01:55:15,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 77082 states and 329650 transitions. [2019-12-27 01:55:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:55:15,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:15,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:15,185 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:15,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:15,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1596901179, now seen corresponding path program 1 times [2019-12-27 01:55:15,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:15,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948580085] [2019-12-27 01:55:15,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:15,257 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-27 01:55:15,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948580085] [2019-12-27 01:55:15,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:15,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:15,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919455162] [2019-12-27 01:55:15,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:15,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:15,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:15,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:15,260 INFO L87 Difference]: Start difference. First operand 77082 states and 329650 transitions. Second operand 3 states. [2019-12-27 01:55:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:18,121 INFO L93 Difference]: Finished difference Result 20478 states and 70372 transitions. [2019-12-27 01:55:18,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:18,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 01:55:18,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:18,218 INFO L225 Difference]: With dead ends: 20478 [2019-12-27 01:55:18,218 INFO L226 Difference]: Without dead ends: 20478 [2019-12-27 01:55:18,219 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-27 01:55:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20478 states. [2019-12-27 01:55:18,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20478 to 20478. [2019-12-27 01:55:18,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20478 states. [2019-12-27 01:55:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20478 states to 20478 states and 70372 transitions. [2019-12-27 01:55:18,762 INFO L78 Accepts]: Start accepts. Automaton has 20478 states and 70372 transitions. Word has length 13 [2019-12-27 01:55:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:18,763 INFO L462 AbstractCegarLoop]: Abstraction has 20478 states and 70372 transitions. [2019-12-27 01:55:18,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 20478 states and 70372 transitions. [2019-12-27 01:55:18,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 01:55:18,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:18,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:18,765 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1662041210, now seen corresponding path program 1 times [2019-12-27 01:55:18,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:18,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305137634] [2019-12-27 01:55:18,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:18,858 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-27 01:55:18,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305137634] [2019-12-27 01:55:18,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:18,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:18,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206629485] [2019-12-27 01:55:18,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:18,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:18,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:18,860 INFO L87 Difference]: Start difference. First operand 20478 states and 70372 transitions. Second operand 4 states. [2019-12-27 01:55:19,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:19,240 INFO L93 Difference]: Finished difference Result 30802 states and 102312 transitions. [2019-12-27 01:55:19,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:19,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 01:55:19,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:19,344 INFO L225 Difference]: With dead ends: 30802 [2019-12-27 01:55:19,345 INFO L226 Difference]: Without dead ends: 30788 [2019-12-27 01:55:19,345 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-27 01:55:19,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30788 states. [2019-12-27 01:55:20,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30788 to 27348. [2019-12-27 01:55:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27348 states. [2019-12-27 01:55:20,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27348 states to 27348 states and 91824 transitions. [2019-12-27 01:55:20,468 INFO L78 Accepts]: Start accepts. Automaton has 27348 states and 91824 transitions. Word has length 13 [2019-12-27 01:55:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:20,468 INFO L462 AbstractCegarLoop]: Abstraction has 27348 states and 91824 transitions. [2019-12-27 01:55:20,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27348 states and 91824 transitions. [2019-12-27 01:55:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:55:20,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:20,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:20,472 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:20,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1480512145, now seen corresponding path program 1 times [2019-12-27 01:55:20,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:20,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577148226] [2019-12-27 01:55:20,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:20,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577148226] [2019-12-27 01:55:20,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:20,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:20,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418400385] [2019-12-27 01:55:20,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:20,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:20,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:20,536 INFO L87 Difference]: Start difference. First operand 27348 states and 91824 transitions. Second operand 4 states. [2019-12-27 01:55:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:20,854 INFO L93 Difference]: Finished difference Result 35523 states and 117963 transitions. [2019-12-27 01:55:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:20,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:55:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:20,925 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 01:55:20,926 INFO L226 Difference]: Without dead ends: 35512 [2019-12-27 01:55:20,926 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-27 01:55:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35512 states. [2019-12-27 01:55:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35512 to 30900. [2019-12-27 01:55:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30900 states. [2019-12-27 01:55:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30900 states to 30900 states and 103384 transitions. [2019-12-27 01:55:22,076 INFO L78 Accepts]: Start accepts. Automaton has 30900 states and 103384 transitions. Word has length 14 [2019-12-27 01:55:22,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:22,080 INFO L462 AbstractCegarLoop]: Abstraction has 30900 states and 103384 transitions. [2019-12-27 01:55:22,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30900 states and 103384 transitions. [2019-12-27 01:55:22,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 01:55:22,082 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:22,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:22,082 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:22,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1480362260, now seen corresponding path program 1 times [2019-12-27 01:55:22,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:22,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518870052] [2019-12-27 01:55:22,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:22,185 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-27 01:55:22,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518870052] [2019-12-27 01:55:22,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:22,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:22,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162843529] [2019-12-27 01:55:22,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:22,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:22,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:22,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:22,187 INFO L87 Difference]: Start difference. First operand 30900 states and 103384 transitions. Second operand 4 states. [2019-12-27 01:55:22,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:22,490 INFO L93 Difference]: Finished difference Result 38443 states and 127475 transitions. [2019-12-27 01:55:22,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:22,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 01:55:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:22,577 INFO L225 Difference]: With dead ends: 38443 [2019-12-27 01:55:22,578 INFO L226 Difference]: Without dead ends: 38432 [2019-12-27 01:55:22,578 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-27 01:55:22,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38432 states. [2019-12-27 01:55:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38432 to 30923. [2019-12-27 01:55:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30923 states. [2019-12-27 01:55:23,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30923 states to 30923 states and 103333 transitions. [2019-12-27 01:55:23,682 INFO L78 Accepts]: Start accepts. Automaton has 30923 states and 103333 transitions. Word has length 14 [2019-12-27 01:55:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:23,682 INFO L462 AbstractCegarLoop]: Abstraction has 30923 states and 103333 transitions. [2019-12-27 01:55:23,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 30923 states and 103333 transitions. [2019-12-27 01:55:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:55:23,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:23,692 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:23,692 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:23,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2067973460, now seen corresponding path program 1 times [2019-12-27 01:55:23,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:23,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907831281] [2019-12-27 01:55:23,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:23,778 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-27 01:55:23,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907831281] [2019-12-27 01:55:23,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:23,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:23,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454632845] [2019-12-27 01:55:23,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:23,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:23,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:23,781 INFO L87 Difference]: Start difference. First operand 30923 states and 103333 transitions. Second operand 5 states. [2019-12-27 01:55:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:24,327 INFO L93 Difference]: Finished difference Result 45281 states and 149378 transitions. [2019-12-27 01:55:24,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:55:24,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:55:24,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:24,404 INFO L225 Difference]: With dead ends: 45281 [2019-12-27 01:55:24,404 INFO L226 Difference]: Without dead ends: 45258 [2019-12-27 01:55:24,405 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-27 01:55:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45258 states. [2019-12-27 01:55:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45258 to 32469. [2019-12-27 01:55:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32469 states. [2019-12-27 01:55:25,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32469 states to 32469 states and 108463 transitions. [2019-12-27 01:55:25,150 INFO L78 Accepts]: Start accepts. Automaton has 32469 states and 108463 transitions. Word has length 22 [2019-12-27 01:55:25,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:25,150 INFO L462 AbstractCegarLoop]: Abstraction has 32469 states and 108463 transitions. [2019-12-27 01:55:25,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32469 states and 108463 transitions. [2019-12-27 01:55:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 01:55:25,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:25,160 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:25,160 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 2068123345, now seen corresponding path program 1 times [2019-12-27 01:55:25,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:25,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445752051] [2019-12-27 01:55:25,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:25,251 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-27 01:55:25,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445752051] [2019-12-27 01:55:25,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:25,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:25,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475908626] [2019-12-27 01:55:25,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:25,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:25,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:25,253 INFO L87 Difference]: Start difference. First operand 32469 states and 108463 transitions. Second operand 5 states. [2019-12-27 01:55:26,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:26,097 INFO L93 Difference]: Finished difference Result 46044 states and 151821 transitions. [2019-12-27 01:55:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 01:55:26,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 01:55:26,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:26,178 INFO L225 Difference]: With dead ends: 46044 [2019-12-27 01:55:26,178 INFO L226 Difference]: Without dead ends: 46021 [2019-12-27 01:55:26,179 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-27 01:55:26,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46021 states. [2019-12-27 01:55:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46021 to 30490. [2019-12-27 01:55:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30490 states. [2019-12-27 01:55:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30490 states to 30490 states and 101754 transitions. [2019-12-27 01:55:26,826 INFO L78 Accepts]: Start accepts. Automaton has 30490 states and 101754 transitions. Word has length 22 [2019-12-27 01:55:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:26,826 INFO L462 AbstractCegarLoop]: Abstraction has 30490 states and 101754 transitions. [2019-12-27 01:55:26,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 30490 states and 101754 transitions. [2019-12-27 01:55:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 01:55:26,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:26,841 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-27 01:55:26,841 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:26,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 668919418, now seen corresponding path program 1 times [2019-12-27 01:55:26,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:26,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681547999] [2019-12-27 01:55:26,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:26,903 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-27 01:55:26,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681547999] [2019-12-27 01:55:26,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:26,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:26,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069011293] [2019-12-27 01:55:26,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:26,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:26,905 INFO L87 Difference]: Start difference. First operand 30490 states and 101754 transitions. Second operand 4 states. [2019-12-27 01:55:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:26,972 INFO L93 Difference]: Finished difference Result 11657 states and 35881 transitions. [2019-12-27 01:55:26,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:55:26,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 01:55:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:26,993 INFO L225 Difference]: With dead ends: 11657 [2019-12-27 01:55:26,993 INFO L226 Difference]: Without dead ends: 11657 [2019-12-27 01:55:26,994 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-27 01:55:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11657 states. [2019-12-27 01:55:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11657 to 11489. [2019-12-27 01:55:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11489 states. [2019-12-27 01:55:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11489 states to 11489 states and 35393 transitions. [2019-12-27 01:55:27,159 INFO L78 Accepts]: Start accepts. Automaton has 11489 states and 35393 transitions. Word has length 25 [2019-12-27 01:55:27,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:27,159 INFO L462 AbstractCegarLoop]: Abstraction has 11489 states and 35393 transitions. [2019-12-27 01:55:27,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 11489 states and 35393 transitions. [2019-12-27 01:55:27,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:55:27,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:27,174 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:27,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:27,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:27,175 INFO L82 PathProgramCache]: Analyzing trace with hash 954456655, now seen corresponding path program 1 times [2019-12-27 01:55:27,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:27,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374764573] [2019-12-27 01:55:27,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:27,217 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-27 01:55:27,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374764573] [2019-12-27 01:55:27,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:27,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:27,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596816477] [2019-12-27 01:55:27,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:27,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:27,221 INFO L87 Difference]: Start difference. First operand 11489 states and 35393 transitions. Second operand 3 states. [2019-12-27 01:55:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:27,316 INFO L93 Difference]: Finished difference Result 15100 states and 45684 transitions. [2019-12-27 01:55:27,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:27,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 01:55:27,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:27,446 INFO L225 Difference]: With dead ends: 15100 [2019-12-27 01:55:27,446 INFO L226 Difference]: Without dead ends: 15100 [2019-12-27 01:55:27,447 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-27 01:55:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15100 states. [2019-12-27 01:55:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15100 to 12271. [2019-12-27 01:55:27,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12271 states. [2019-12-27 01:55:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 37679 transitions. [2019-12-27 01:55:27,669 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 37679 transitions. Word has length 39 [2019-12-27 01:55:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:27,670 INFO L462 AbstractCegarLoop]: Abstraction has 12271 states and 37679 transitions. [2019-12-27 01:55:27,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 37679 transitions. [2019-12-27 01:55:27,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 01:55:27,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:27,689 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:27,689 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:27,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash 515851026, now seen corresponding path program 1 times [2019-12-27 01:55:27,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:27,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551768107] [2019-12-27 01:55:27,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:27,769 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-27 01:55:27,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551768107] [2019-12-27 01:55:27,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:27,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 01:55:27,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280119670] [2019-12-27 01:55:27,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 01:55:27,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:27,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 01:55:27,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 01:55:27,771 INFO L87 Difference]: Start difference. First operand 12271 states and 37679 transitions. Second operand 5 states. [2019-12-27 01:55:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:27,841 INFO L93 Difference]: Finished difference Result 11017 states and 34440 transitions. [2019-12-27 01:55:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 01:55:27,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-27 01:55:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:27,861 INFO L225 Difference]: With dead ends: 11017 [2019-12-27 01:55:27,861 INFO L226 Difference]: Without dead ends: 11017 [2019-12-27 01:55:27,861 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-27 01:55:27,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11017 states. [2019-12-27 01:55:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11017 to 10393. [2019-12-27 01:55:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10393 states. [2019-12-27 01:55:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10393 states to 10393 states and 32688 transitions. [2019-12-27 01:55:28,022 INFO L78 Accepts]: Start accepts. Automaton has 10393 states and 32688 transitions. Word has length 39 [2019-12-27 01:55:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:28,022 INFO L462 AbstractCegarLoop]: Abstraction has 10393 states and 32688 transitions. [2019-12-27 01:55:28,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 01:55:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10393 states and 32688 transitions. [2019-12-27 01:55:28,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:28,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:28,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:28,040 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash 165786421, now seen corresponding path program 1 times [2019-12-27 01:55:28,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:28,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781534386] [2019-12-27 01:55:28,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 01:55:28,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781534386] [2019-12-27 01:55:28,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:28,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 01:55:28,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213936993] [2019-12-27 01:55:28,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 01:55:28,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 01:55:28,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 01:55:28,122 INFO L87 Difference]: Start difference. First operand 10393 states and 32688 transitions. Second operand 4 states. [2019-12-27 01:55:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:28,208 INFO L93 Difference]: Finished difference Result 18723 states and 58888 transitions. [2019-12-27 01:55:28,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 01:55:28,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-12-27 01:55:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:28,222 INFO L225 Difference]: With dead ends: 18723 [2019-12-27 01:55:28,222 INFO L226 Difference]: Without dead ends: 8627 [2019-12-27 01:55:28,223 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-27 01:55:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-12-27 01:55:28,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 8627. [2019-12-27 01:55:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8627 states. [2019-12-27 01:55:28,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8627 states to 8627 states and 27021 transitions. [2019-12-27 01:55:28,361 INFO L78 Accepts]: Start accepts. Automaton has 8627 states and 27021 transitions. Word has length 53 [2019-12-27 01:55:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:28,361 INFO L462 AbstractCegarLoop]: Abstraction has 8627 states and 27021 transitions. [2019-12-27 01:55:28,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 01:55:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 8627 states and 27021 transitions. [2019-12-27 01:55:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:28,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:28,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:28,375 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:28,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:28,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1891813083, now seen corresponding path program 2 times [2019-12-27 01:55:28,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:28,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970629992] [2019-12-27 01:55:28,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:28,473 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-27 01:55:28,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970629992] [2019-12-27 01:55:28,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:28,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:28,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764990418] [2019-12-27 01:55:28,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:28,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:28,475 INFO L87 Difference]: Start difference. First operand 8627 states and 27021 transitions. Second operand 7 states. [2019-12-27 01:55:28,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:28,867 INFO L93 Difference]: Finished difference Result 24029 states and 75191 transitions. [2019-12-27 01:55:28,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:55:28,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:55:28,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:28,901 INFO L225 Difference]: With dead ends: 24029 [2019-12-27 01:55:28,902 INFO L226 Difference]: Without dead ends: 18333 [2019-12-27 01:55:28,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:55:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18333 states. [2019-12-27 01:55:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18333 to 10739. [2019-12-27 01:55:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10739 states. [2019-12-27 01:55:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10739 states to 10739 states and 33937 transitions. [2019-12-27 01:55:29,125 INFO L78 Accepts]: Start accepts. Automaton has 10739 states and 33937 transitions. Word has length 53 [2019-12-27 01:55:29,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:29,125 INFO L462 AbstractCegarLoop]: Abstraction has 10739 states and 33937 transitions. [2019-12-27 01:55:29,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:29,125 INFO L276 IsEmpty]: Start isEmpty. Operand 10739 states and 33937 transitions. [2019-12-27 01:55:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:29,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:29,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:29,142 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:29,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1878615555, now seen corresponding path program 3 times [2019-12-27 01:55:29,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:29,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465331732] [2019-12-27 01:55:29,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:29,232 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-27 01:55:29,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465331732] [2019-12-27 01:55:29,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:29,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 01:55:29,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573370358] [2019-12-27 01:55:29,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 01:55:29,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 01:55:29,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 01:55:29,235 INFO L87 Difference]: Start difference. First operand 10739 states and 33937 transitions. Second operand 7 states. [2019-12-27 01:55:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:29,773 INFO L93 Difference]: Finished difference Result 29619 states and 91701 transitions. [2019-12-27 01:55:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:55:29,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-27 01:55:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:29,818 INFO L225 Difference]: With dead ends: 29619 [2019-12-27 01:55:29,819 INFO L226 Difference]: Without dead ends: 21040 [2019-12-27 01:55:29,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 01:55:29,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21040 states. [2019-12-27 01:55:30,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21040 to 13259. [2019-12-27 01:55:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13259 states. [2019-12-27 01:55:30,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13259 states to 13259 states and 41902 transitions. [2019-12-27 01:55:30,124 INFO L78 Accepts]: Start accepts. Automaton has 13259 states and 41902 transitions. Word has length 53 [2019-12-27 01:55:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:30,124 INFO L462 AbstractCegarLoop]: Abstraction has 13259 states and 41902 transitions. [2019-12-27 01:55:30,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 01:55:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 13259 states and 41902 transitions. [2019-12-27 01:55:30,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:30,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:30,142 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:30,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:30,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 193726155, now seen corresponding path program 4 times [2019-12-27 01:55:30,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:30,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421845927] [2019-12-27 01:55:30,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:30,214 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-27 01:55:30,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421845927] [2019-12-27 01:55:30,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:30,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:30,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452981028] [2019-12-27 01:55:30,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:30,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:30,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:30,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:30,216 INFO L87 Difference]: Start difference. First operand 13259 states and 41902 transitions. Second operand 3 states. [2019-12-27 01:55:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:30,300 INFO L93 Difference]: Finished difference Result 19683 states and 62661 transitions. [2019-12-27 01:55:30,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:30,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:55:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:30,311 INFO L225 Difference]: With dead ends: 19683 [2019-12-27 01:55:30,311 INFO L226 Difference]: Without dead ends: 6496 [2019-12-27 01:55:30,312 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-27 01:55:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6496 states. [2019-12-27 01:55:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6496 to 6496. [2019-12-27 01:55:30,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-27 01:55:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 20893 transitions. [2019-12-27 01:55:30,417 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 20893 transitions. Word has length 53 [2019-12-27 01:55:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:30,417 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 20893 transitions. [2019-12-27 01:55:30,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 20893 transitions. [2019-12-27 01:55:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:30,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:30,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:30,426 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 819014287, now seen corresponding path program 5 times [2019-12-27 01:55:30,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:30,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206347604] [2019-12-27 01:55:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:30,557 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-27 01:55:30,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206347604] [2019-12-27 01:55:30,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:30,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:30,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462823914] [2019-12-27 01:55:30,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:30,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:30,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:30,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:30,559 INFO L87 Difference]: Start difference. First operand 6496 states and 20893 transitions. Second operand 9 states. [2019-12-27 01:55:31,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:31,913 INFO L93 Difference]: Finished difference Result 34361 states and 106385 transitions. [2019-12-27 01:55:31,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 01:55:31,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 01:55:31,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:31,954 INFO L225 Difference]: With dead ends: 34361 [2019-12-27 01:55:31,954 INFO L226 Difference]: Without dead ends: 27058 [2019-12-27 01:55:31,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 01:55:32,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27058 states. [2019-12-27 01:55:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27058 to 8895. [2019-12-27 01:55:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8895 states. [2019-12-27 01:55:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8895 states to 8895 states and 28920 transitions. [2019-12-27 01:55:32,237 INFO L78 Accepts]: Start accepts. Automaton has 8895 states and 28920 transitions. Word has length 53 [2019-12-27 01:55:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:32,237 INFO L462 AbstractCegarLoop]: Abstraction has 8895 states and 28920 transitions. [2019-12-27 01:55:32,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 8895 states and 28920 transitions. [2019-12-27 01:55:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:32,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:32,249 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:32,249 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:32,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:32,249 INFO L82 PathProgramCache]: Analyzing trace with hash 743806145, now seen corresponding path program 6 times [2019-12-27 01:55:32,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:32,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82372347] [2019-12-27 01:55:32,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:32,361 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-27 01:55:32,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82372347] [2019-12-27 01:55:32,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:32,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:32,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676327660] [2019-12-27 01:55:32,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:32,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:32,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:32,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:32,365 INFO L87 Difference]: Start difference. First operand 8895 states and 28920 transitions. Second operand 9 states. [2019-12-27 01:55:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:33,607 INFO L93 Difference]: Finished difference Result 25540 states and 79803 transitions. [2019-12-27 01:55:33,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 01:55:33,608 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 01:55:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:33,644 INFO L225 Difference]: With dead ends: 25540 [2019-12-27 01:55:33,644 INFO L226 Difference]: Without dead ends: 23475 [2019-12-27 01:55:33,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=820, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 01:55:33,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23475 states. [2019-12-27 01:55:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23475 to 8823. [2019-12-27 01:55:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8823 states. [2019-12-27 01:55:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8823 states to 8823 states and 28692 transitions. [2019-12-27 01:55:33,905 INFO L78 Accepts]: Start accepts. Automaton has 8823 states and 28692 transitions. Word has length 53 [2019-12-27 01:55:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:33,905 INFO L462 AbstractCegarLoop]: Abstraction has 8823 states and 28692 transitions. [2019-12-27 01:55:33,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 8823 states and 28692 transitions. [2019-12-27 01:55:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:33,917 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:33,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:33,917 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:33,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:33,918 INFO L82 PathProgramCache]: Analyzing trace with hash -249470771, now seen corresponding path program 7 times [2019-12-27 01:55:33,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:33,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718657800] [2019-12-27 01:55:33,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:34,082 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-27 01:55:34,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718657800] [2019-12-27 01:55:34,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:34,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:55:34,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888306447] [2019-12-27 01:55:34,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:34,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:34,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:34,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:34,083 INFO L87 Difference]: Start difference. First operand 8823 states and 28692 transitions. Second operand 9 states. [2019-12-27 01:55:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:34,820 INFO L93 Difference]: Finished difference Result 13710 states and 41477 transitions. [2019-12-27 01:55:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:55:34,821 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-27 01:55:34,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:34,849 INFO L225 Difference]: With dead ends: 13710 [2019-12-27 01:55:34,849 INFO L226 Difference]: Without dead ends: 13626 [2019-12-27 01:55:34,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:55:34,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13626 states. [2019-12-27 01:55:35,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13626 to 11475. [2019-12-27 01:55:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11475 states. [2019-12-27 01:55:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11475 states to 11475 states and 35386 transitions. [2019-12-27 01:55:35,075 INFO L78 Accepts]: Start accepts. Automaton has 11475 states and 35386 transitions. Word has length 53 [2019-12-27 01:55:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:35,075 INFO L462 AbstractCegarLoop]: Abstraction has 11475 states and 35386 transitions. [2019-12-27 01:55:35,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 11475 states and 35386 transitions. [2019-12-27 01:55:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:35,092 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:35,092 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:35,092 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1491786391, now seen corresponding path program 8 times [2019-12-27 01:55:35,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:35,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985507542] [2019-12-27 01:55:35,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:35,225 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-27 01:55:35,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985507542] [2019-12-27 01:55:35,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:35,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:35,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357711545] [2019-12-27 01:55:35,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 01:55:35,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:35,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 01:55:35,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 01:55:35,227 INFO L87 Difference]: Start difference. First operand 11475 states and 35386 transitions. Second operand 8 states. [2019-12-27 01:55:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:36,028 INFO L93 Difference]: Finished difference Result 17460 states and 52110 transitions. [2019-12-27 01:55:36,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 01:55:36,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 01:55:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:36,054 INFO L225 Difference]: With dead ends: 17460 [2019-12-27 01:55:36,054 INFO L226 Difference]: Without dead ends: 17350 [2019-12-27 01:55:36,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-27 01:55:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17350 states. [2019-12-27 01:55:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17350 to 13803. [2019-12-27 01:55:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13803 states. [2019-12-27 01:55:36,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 42125 transitions. [2019-12-27 01:55:36,374 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 42125 transitions. Word has length 53 [2019-12-27 01:55:36,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:36,374 INFO L462 AbstractCegarLoop]: Abstraction has 13803 states and 42125 transitions. [2019-12-27 01:55:36,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 01:55:36,374 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 42125 transitions. [2019-12-27 01:55:36,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 01:55:36,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:36,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:36,390 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:36,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:36,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1750340863, now seen corresponding path program 9 times [2019-12-27 01:55:36,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:36,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146880491] [2019-12-27 01:55:36,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:36,448 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-27 01:55:36,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146880491] [2019-12-27 01:55:36,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:36,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:36,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760055839] [2019-12-27 01:55:36,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:36,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:36,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:36,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:36,450 INFO L87 Difference]: Start difference. First operand 13803 states and 42125 transitions. Second operand 3 states. [2019-12-27 01:55:36,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:36,512 INFO L93 Difference]: Finished difference Result 13801 states and 42120 transitions. [2019-12-27 01:55:36,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:36,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 01:55:36,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:36,538 INFO L225 Difference]: With dead ends: 13801 [2019-12-27 01:55:36,538 INFO L226 Difference]: Without dead ends: 13801 [2019-12-27 01:55:36,539 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-27 01:55:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13801 states. [2019-12-27 01:55:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13801 to 12282. [2019-12-27 01:55:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12282 states. [2019-12-27 01:55:36,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12282 states to 12282 states and 37978 transitions. [2019-12-27 01:55:36,820 INFO L78 Accepts]: Start accepts. Automaton has 12282 states and 37978 transitions. Word has length 53 [2019-12-27 01:55:36,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:36,820 INFO L462 AbstractCegarLoop]: Abstraction has 12282 states and 37978 transitions. [2019-12-27 01:55:36,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand 12282 states and 37978 transitions. [2019-12-27 01:55:36,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 01:55:36,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:36,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 01:55:36,833 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:36,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:36,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1788158321, now seen corresponding path program 1 times [2019-12-27 01:55:36,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:36,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485269770] [2019-12-27 01:55:36,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:36,897 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-27 01:55:36,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485269770] [2019-12-27 01:55:36,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:36,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 01:55:36,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101237652] [2019-12-27 01:55:36,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 01:55:36,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 01:55:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 01:55:36,899 INFO L87 Difference]: Start difference. First operand 12282 states and 37978 transitions. Second operand 3 states. [2019-12-27 01:55:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:36,948 INFO L93 Difference]: Finished difference Result 9469 states and 29058 transitions. [2019-12-27 01:55:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 01:55:36,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 01:55:36,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:36,966 INFO L225 Difference]: With dead ends: 9469 [2019-12-27 01:55:36,966 INFO L226 Difference]: Without dead ends: 9469 [2019-12-27 01:55:36,967 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-27 01:55:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9469 states. [2019-12-27 01:55:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9469 to 9173. [2019-12-27 01:55:37,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9173 states. [2019-12-27 01:55:37,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9173 states to 9173 states and 28178 transitions. [2019-12-27 01:55:37,238 INFO L78 Accepts]: Start accepts. Automaton has 9173 states and 28178 transitions. Word has length 54 [2019-12-27 01:55:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:37,239 INFO L462 AbstractCegarLoop]: Abstraction has 9173 states and 28178 transitions. [2019-12-27 01:55:37,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 01:55:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 9173 states and 28178 transitions. [2019-12-27 01:55:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:55:37,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:37,259 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] [2019-12-27 01:55:37,259 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:37,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:37,259 INFO L82 PathProgramCache]: Analyzing trace with hash 404282337, now seen corresponding path program 1 times [2019-12-27 01:55:37,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:37,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91746375] [2019-12-27 01:55:37,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:37,438 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-27 01:55:37,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91746375] [2019-12-27 01:55:37,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:37,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 01:55:37,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473001937] [2019-12-27 01:55:37,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 01:55:37,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:37,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 01:55:37,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-27 01:55:37,440 INFO L87 Difference]: Start difference. First operand 9173 states and 28178 transitions. Second operand 9 states. [2019-12-27 01:55:38,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:38,395 INFO L93 Difference]: Finished difference Result 16828 states and 51273 transitions. [2019-12-27 01:55:38,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 01:55:38,395 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-12-27 01:55:38,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:38,413 INFO L225 Difference]: With dead ends: 16828 [2019-12-27 01:55:38,413 INFO L226 Difference]: Without dead ends: 11009 [2019-12-27 01:55:38,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2019-12-27 01:55:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11009 states. [2019-12-27 01:55:38,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11009 to 9495. [2019-12-27 01:55:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9495 states. [2019-12-27 01:55:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9495 states to 9495 states and 28846 transitions. [2019-12-27 01:55:38,564 INFO L78 Accepts]: Start accepts. Automaton has 9495 states and 28846 transitions. Word has length 55 [2019-12-27 01:55:38,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:38,565 INFO L462 AbstractCegarLoop]: Abstraction has 9495 states and 28846 transitions. [2019-12-27 01:55:38,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 01:55:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 9495 states and 28846 transitions. [2019-12-27 01:55:38,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:55:38,575 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:38,575 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] [2019-12-27 01:55:38,575 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:38,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:38,575 INFO L82 PathProgramCache]: Analyzing trace with hash 905870895, now seen corresponding path program 2 times [2019-12-27 01:55:38,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:38,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863882896] [2019-12-27 01:55:38,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 01:55:38,733 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-27 01:55:38,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863882896] [2019-12-27 01:55:38,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 01:55:38,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 01:55:38,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689604249] [2019-12-27 01:55:38,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 01:55:38,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 01:55:38,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 01:55:38,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 01:55:38,736 INFO L87 Difference]: Start difference. First operand 9495 states and 28846 transitions. Second operand 11 states. [2019-12-27 01:55:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 01:55:39,507 INFO L93 Difference]: Finished difference Result 12737 states and 38203 transitions. [2019-12-27 01:55:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 01:55:39,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 01:55:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 01:55:39,522 INFO L225 Difference]: With dead ends: 12737 [2019-12-27 01:55:39,522 INFO L226 Difference]: Without dead ends: 10167 [2019-12-27 01:55:39,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-12-27 01:55:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10167 states. [2019-12-27 01:55:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10167 to 9028. [2019-12-27 01:55:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9028 states. [2019-12-27 01:55:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9028 states to 9028 states and 27386 transitions. [2019-12-27 01:55:39,763 INFO L78 Accepts]: Start accepts. Automaton has 9028 states and 27386 transitions. Word has length 55 [2019-12-27 01:55:39,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 01:55:39,763 INFO L462 AbstractCegarLoop]: Abstraction has 9028 states and 27386 transitions. [2019-12-27 01:55:39,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 01:55:39,763 INFO L276 IsEmpty]: Start isEmpty. Operand 9028 states and 27386 transitions. [2019-12-27 01:55:39,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 01:55:39,772 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 01:55:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-27 01:55:39,772 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 01:55:39,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 01:55:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash 406067685, now seen corresponding path program 3 times [2019-12-27 01:55:39,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 01:55:39,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302671599] [2019-12-27 01:55:39,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 01:55:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:55:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 01:55:39,905 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 01:55:39,906 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 01:55:39,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~y$r_buff0_thd1~0_335 0) (= 0 v_~y$r_buff1_thd3~0_125) (= v_~x~0_35 0) (= v_~y$w_buff1~0_269 0) (= 0 v_~y$r_buff1_thd2~0_133) (= v_~a~0_54 0) (= v_~y$w_buff1_used~0_559 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28|)) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= 0 v_~__unbuffered_p2_EAX~0_59) (= 0 v_~y$r_buff0_thd2~0_172) (= v_~y$read_delayed~0_6 0) (< 0 |v_#StackHeapBarrier_18|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) (= |v_ULTIMATE.start_main_~#t642~0.offset_19| 0) (= v_~y$w_buff0_used~0_854 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= v_~__unbuffered_p0_EBX~0_53 0) (= v_~z~0_107 0) (= 0 v_~y$r_buff0_thd3~0_136) (= v_~weak$$choice2~0_153 0) (= v_~y$mem_tmp~0_47 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t642~0.base_28| 1)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t642~0.base_28| 4)) (= v_~__unbuffered_p2_EBX~0_59 0) (= v_~main$tmp_guard0~0_21 0) (= v_~__unbuffered_cnt~0_162 0) (= 0 v_~y$flush_delayed~0_90) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_138 0) (= 0 v_~y$w_buff0~0_440) (= v_~y$r_buff1_thd1~0_236 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_34) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t642~0.base_28|) |v_ULTIMATE.start_main_~#t642~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_136 0) (= v_~y~0_214 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_~#t642~0.offset=|v_ULTIMATE.start_main_~#t642~0.offset_19|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_37|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_33|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_23|, ~a~0=v_~a~0_54, ~y$mem_tmp~0=v_~y$mem_tmp~0_47, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_335, ~y$flush_delayed~0=v_~y$flush_delayed~0_90, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_59, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_59, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$w_buff1~0=v_~y$w_buff1~0_269, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_172, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_162, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~x~0=v_~x~0_35, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_854, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_95|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_67|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_37|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_440, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_136, ULTIMATE.start_main_~#t642~0.base=|v_ULTIMATE.start_main_~#t642~0.base_28|, ~y~0=v_~y~0_214, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_17|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_17|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_138, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_559} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_~#t642~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t644~0.base, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t644~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t642~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:55:39,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L831-1-->L833: Formula: (and (= |v_ULTIMATE.start_main_~#t643~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t643~0.base_11|) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11|) 0) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t643~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t643~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t643~0.base_11|) |v_ULTIMATE.start_main_~#t643~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t643~0.base_11| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t643~0.offset=|v_ULTIMATE.start_main_~#t643~0.offset_10|, ULTIMATE.start_main_~#t643~0.base=|v_ULTIMATE.start_main_~#t643~0.base_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t643~0.offset, ULTIMATE.start_main_~#t643~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 01:55:39,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L833-1-->L835: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t644~0.base_11|) |v_ULTIMATE.start_main_~#t644~0.offset_10| 2)) |v_#memory_int_11|) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t644~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t644~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t644~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t644~0.offset_10| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t644~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t644~0.base=|v_ULTIMATE.start_main_~#t644~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t644~0.offset=|v_ULTIMATE.start_main_~#t644~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t644~0.base, ULTIMATE.start_main_~#t644~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 01:55:39,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] P1ENTRY-->L5-3: Formula: (and (= ~y$w_buff0~0_Out1868658458 1) (= |P1Thread1of1ForFork1_#in~arg.base_In1868658458| P1Thread1of1ForFork1_~arg.base_Out1868658458) (= P1Thread1of1ForFork1_~arg.offset_Out1868658458 |P1Thread1of1ForFork1_#in~arg.offset_In1868658458|) (= ~y$w_buff0~0_In1868658458 ~y$w_buff1~0_Out1868658458) (= ~y$w_buff1_used~0_Out1868658458 ~y$w_buff0_used~0_In1868658458) (= 1 ~y$w_buff0_used~0_Out1868658458) (= 1 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1868658458|) (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1868658458 |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1868658458|) (= 0 (mod ~y$w_buff1_used~0_Out1868658458 256))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1868658458, ~y$w_buff0~0=~y$w_buff0~0_In1868658458, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1868658458|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1868658458|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_Out1868658458, P1Thread1of1ForFork1_~arg.offset=P1Thread1of1ForFork1_~arg.offset_Out1868658458, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out1868658458, ~y$w_buff1~0=~y$w_buff1~0_Out1868658458, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_Out1868658458|, P1Thread1of1ForFork1_~arg.base=P1Thread1of1ForFork1_~arg.base_Out1868658458, ~y$w_buff0~0=~y$w_buff0~0_Out1868658458, P1Thread1of1ForFork1_#in~arg.base=|P1Thread1of1ForFork1_#in~arg.base_In1868658458|, P1Thread1of1ForFork1_#in~arg.offset=|P1Thread1of1ForFork1_#in~arg.offset_In1868658458|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1868658458} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 01:55:39,917 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In505369303 256) 0)) (.cse2 (= |P2Thread1of1ForFork2_#t~ite33_Out505369303| |P2Thread1of1ForFork2_#t~ite32_Out505369303|)) (.cse1 (= (mod ~y$w_buff1_used~0_In505369303 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In505369303 |P2Thread1of1ForFork2_#t~ite32_Out505369303|)) (and (not .cse0) (= ~y$w_buff1~0_In505369303 |P2Thread1of1ForFork2_#t~ite32_Out505369303|) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In505369303, ~y$w_buff1~0=~y$w_buff1~0_In505369303, ~y~0=~y~0_In505369303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In505369303} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In505369303, ~y$w_buff1~0=~y$w_buff1~0_In505369303, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out505369303|, P2Thread1of1ForFork2_#t~ite32=|P2Thread1of1ForFork2_#t~ite32_Out505369303|, ~y~0=~y~0_In505369303, ~y$w_buff1_used~0=~y$w_buff1_used~0_In505369303} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-27 01:55:39,918 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-268156138 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-268156138 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-268156138| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-268156138 |P1Thread1of1ForFork1_#t~ite28_Out-268156138|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-268156138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-268156138} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-268156138, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-268156138, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-268156138|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 01:55:39,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In877955791 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In877955791 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In877955791 |P2Thread1of1ForFork2_#t~ite34_Out877955791|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite34_Out877955791|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In877955791, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In877955791} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out877955791|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In877955791, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In877955791} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34] because there is no mapped edge [2019-12-27 01:55:39,920 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-2095995544 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2095995544 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2095995544 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-2095995544 256)))) (or (and (= ~y$w_buff1_used~0_In-2095995544 |P2Thread1of1ForFork2_#t~ite35_Out-2095995544|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite35_Out-2095995544| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2095995544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095995544, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2095995544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095995544} OutVars{P2Thread1of1ForFork2_#t~ite35=|P2Thread1of1ForFork2_#t~ite35_Out-2095995544|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2095995544, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2095995544, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2095995544, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2095995544} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite35] because there is no mapped edge [2019-12-27 01:55:39,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1278219757 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1278219757 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In1278219757 |P2Thread1of1ForFork2_#t~ite36_Out1278219757|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite36_Out1278219757|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1278219757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1278219757} OutVars{P2Thread1of1ForFork2_#t~ite36=|P2Thread1of1ForFork2_#t~ite36_Out1278219757|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1278219757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1278219757} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite36] because there is no mapped edge [2019-12-27 01:55:39,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In221855097 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In221855097 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In221855097 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In221855097 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite37_Out221855097|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In221855097 |P2Thread1of1ForFork2_#t~ite37_Out221855097|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In221855097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221855097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In221855097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221855097} OutVars{P2Thread1of1ForFork2_#t~ite37=|P2Thread1of1ForFork2_#t~ite37_Out221855097|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In221855097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221855097, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In221855097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221855097} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37] because there is no mapped edge [2019-12-27 01:55:39,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L812-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite37_40| v_~y$r_buff1_thd3~0_74) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_39|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 01:55:39,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L787-->L787-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In822198906 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In822198906 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In822198906 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In822198906 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out822198906|)) (and (= ~y$w_buff1_used~0_In822198906 |P1Thread1of1ForFork1_#t~ite29_Out822198906|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In822198906, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822198906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In822198906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In822198906} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In822198906, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out822198906|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822198906, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In822198906, ~y$w_buff1_used~0=~y$w_buff1_used~0_In822198906} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 01:55:39,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L788-->L789: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-207831695 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-207831695 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-207831695)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-207831695 ~y$r_buff0_thd2~0_Out-207831695)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-207831695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-207831695} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-207831695|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-207831695, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-207831695} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 01:55:39,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L789-->L789-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-523965558 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-523965558 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-523965558 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-523965558 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite31_Out-523965558|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-523965558 |P1Thread1of1ForFork1_#t~ite31_Out-523965558|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-523965558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-523965558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-523965558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-523965558} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-523965558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-523965558, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-523965558|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-523965558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-523965558} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 01:55:39,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L789-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P1Thread1of1ForFork1_#t~ite31_40| v_~y$r_buff1_thd2~0_54) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 01:55:39,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L750-->L750-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2025904871 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out2025904871| |P0Thread1of1ForFork0_#t~ite9_Out2025904871|) (= ~y$w_buff0~0_In2025904871 |P0Thread1of1ForFork0_#t~ite8_Out2025904871|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2025904871 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd1~0_In2025904871 256))) (and (= 0 (mod ~y$w_buff1_used~0_In2025904871 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In2025904871 256)))) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite8_In2025904871| |P0Thread1of1ForFork0_#t~ite8_Out2025904871|) (= ~y$w_buff0~0_In2025904871 |P0Thread1of1ForFork0_#t~ite9_Out2025904871|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2025904871, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2025904871, ~y$w_buff0~0=~y$w_buff0~0_In2025904871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2025904871, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_In2025904871|, ~weak$$choice2~0=~weak$$choice2~0_In2025904871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2025904871} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2025904871, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out2025904871|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2025904871, ~y$w_buff0~0=~y$w_buff0~0_In2025904871, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2025904871|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2025904871, ~weak$$choice2~0=~weak$$choice2~0_In2025904871, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2025904871} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite9, P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 01:55:39,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L751-->L751-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In829480383 256)))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite11_Out829480383| ~y$w_buff1~0_In829480383) (= |P0Thread1of1ForFork0_#t~ite11_Out829480383| |P0Thread1of1ForFork0_#t~ite12_Out829480383|) (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In829480383 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In829480383 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In829480383 256)) (and (= 0 (mod ~y$r_buff1_thd1~0_In829480383 256)) .cse1)))) (and (= ~y$w_buff1~0_In829480383 |P0Thread1of1ForFork0_#t~ite12_Out829480383|) (= |P0Thread1of1ForFork0_#t~ite11_In829480383| |P0Thread1of1ForFork0_#t~ite11_Out829480383|) (not .cse0)))) InVars {P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_In829480383|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In829480383, ~y$w_buff1~0=~y$w_buff1~0_In829480383, ~y$w_buff0_used~0=~y$w_buff0_used~0_In829480383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In829480383, ~weak$$choice2~0=~weak$$choice2~0_In829480383, ~y$w_buff1_used~0=~y$w_buff1_used~0_In829480383} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out829480383|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In829480383, ~y$w_buff1~0=~y$w_buff1~0_In829480383, ~y$w_buff0_used~0=~y$w_buff0_used~0_In829480383, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In829480383, ~weak$$choice2~0=~weak$$choice2~0_In829480383, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out829480383|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In829480383} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11, P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 01:55:39,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L754-->L755-8: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite22_35| |v_P0Thread1of1ForFork0_#t~ite22_34|) (= |v_P0Thread1of1ForFork0_#t~ite23_31| |v_P0Thread1of1ForFork0_#t~ite23_30|) (= v_~y$r_buff1_thd1~0_224 |v_P0Thread1of1ForFork0_#t~ite24_32|) (= v_~y$r_buff0_thd1~0_326 v_~y$r_buff0_thd1~0_325) (not (= 0 (mod v_~weak$$choice2~0_143 256)))) InVars {P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_35|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_326, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_31|} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_34|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_224, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_37|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_48|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_325, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_33|, ~weak$$choice2~0=v_~weak$$choice2~0_143, P0Thread1of1ForFork0_#t~ite24=|v_P0Thread1of1ForFork0_#t~ite24_32|, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_30|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19, P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 01:55:39,933 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L757-->L765: Formula: (and (not (= (mod v_~y$flush_delayed~0_17 256) 0)) (= v_~y~0_46 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_16) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_21|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_46} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 01:55:39,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L835-1-->L841: Formula: (and (= 3 v_~__unbuffered_cnt~0_42) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 01:55:39,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L841-2-->L841-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1031214791 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1031214791 256)))) (or (and (= ~y~0_In-1031214791 |ULTIMATE.start_main_#t~ite41_Out-1031214791|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-1031214791 |ULTIMATE.start_main_#t~ite41_Out-1031214791|) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1031214791, ~y~0=~y~0_In-1031214791, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1031214791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1031214791} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1031214791|, ~y$w_buff1~0=~y$w_buff1~0_In-1031214791, ~y~0=~y~0_In-1031214791, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1031214791, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1031214791} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 01:55:39,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L841-4-->L842: Formula: (= v_~y~0_14 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ~y~0=v_~y~0_14, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 01:55:39,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L842-->L842-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In168261737 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In168261737 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out168261737| ~y$w_buff0_used~0_In168261737)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out168261737|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In168261737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In168261737} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In168261737, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In168261737, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out168261737|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 01:55:39,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In279951205 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In279951205 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In279951205 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In279951205 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out279951205| ~y$w_buff1_used~0_In279951205) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out279951205| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In279951205, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In279951205, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In279951205, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279951205} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In279951205, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In279951205, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In279951205, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out279951205|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In279951205} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 01:55:39,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1424244254 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1424244254 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1424244254|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1424244254 |ULTIMATE.start_main_#t~ite45_Out1424244254|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1424244254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1424244254} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1424244254, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1424244254, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1424244254|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 01:55:39,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L845-->L845-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-756861135 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-756861135 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-756861135 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-756861135 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-756861135|)) (and (= ~y$r_buff1_thd0~0_In-756861135 |ULTIMATE.start_main_#t~ite46_Out-756861135|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-756861135, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-756861135, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-756861135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-756861135} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-756861135, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-756861135, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-756861135|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-756861135, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-756861135} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 01:55:39,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= v_~z~0_50 2) (= 1 v_~__unbuffered_p0_EAX~0_34) (= v_~__unbuffered_p0_EBX~0_19 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= 2 v_~__unbuffered_p2_EAX~0_22) (= |v_ULTIMATE.start_main_#t~ite46_39| v_~y$r_buff1_thd0~0_74) (= v_~__unbuffered_p2_EBX~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_34, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~z~0=v_~z~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_74, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 01:55:40,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 01:55:40 BasicIcfg [2019-12-27 01:55:40,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 01:55:40,025 INFO L168 Benchmark]: Toolchain (without parser) took 52082.62 ms. Allocated memory was 147.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 103.7 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 724.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,026 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.19 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.3 MB in the beginning and 157.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,027 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.84 ms. Allocated memory is still 205.5 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,027 INFO L168 Benchmark]: Boogie Preprocessor took 54.77 ms. Allocated memory is still 205.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,028 INFO L168 Benchmark]: RCFGBuilder took 813.41 ms. Allocated memory is still 205.5 MB. Free memory was 152.0 MB in the beginning and 105.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,029 INFO L168 Benchmark]: TraceAbstraction took 50313.51 ms. Allocated memory was 205.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 667.4 MB. Max. memory is 7.1 GB. [2019-12-27 01:55:40,032 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.24 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 824.19 ms. Allocated memory was 147.3 MB in the beginning and 205.5 MB in the end (delta: 58.2 MB). Free memory was 103.3 MB in the beginning and 157.1 MB in the end (delta: -53.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.84 ms. Allocated memory is still 205.5 MB. Free memory was 157.1 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.77 ms. Allocated memory is still 205.5 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.41 ms. Allocated memory is still 205.5 MB. Free memory was 152.0 MB in the beginning and 105.2 MB in the end (delta: 46.8 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 50313.51 ms. Allocated memory was 205.5 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 104.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 667.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 166 ProgramPointsBefore, 83 ProgramPointsAfterwards, 197 TransitionsBefore, 90 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 6616 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 74173 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t642, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] FCALL, FORK 0 pthread_create(&t643, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t644, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L775] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L776] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L777] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L778] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L779] 2 y$r_buff0_thd2 = (_Bool)1 [L782] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L785] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 z = 2 [L802] 3 __unbuffered_p2_EAX = z [L805] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L808] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L736] 1 a = 1 [L739] 1 x = 1 [L742] 1 __unbuffered_p0_EAX = x [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 y$flush_delayed = weak$$choice2 [L748] 1 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L749] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L750] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L751] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L752] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L752] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L841] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 157 locations, 2 error locations. Result: UNSAFE, OverallTime: 49.9s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3942 SDtfs, 5793 SDslu, 11077 SDs, 0 SdLazy, 5212 SolverSat, 308 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 41 SyntacticMatches, 14 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82802occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 105858 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 902 NumberOfCodeBlocks, 902 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 825 ConstructedInterpolants, 0 QuantifiedInterpolants, 138369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...