/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:36:24,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:36:24,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:36:24,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:36:24,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:36:24,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:36:24,961 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:36:24,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:36:24,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:36:24,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:36:24,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:36:24,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:36:24,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:36:24,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:36:24,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:36:24,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:36:24,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:36:24,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:36:24,975 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:36:24,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:36:24,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:36:24,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:36:24,981 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:36:24,982 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:36:24,984 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:36:24,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:36:24,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:36:24,986 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:36:24,986 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:36:24,987 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:36:24,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:36:24,988 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:36:24,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:36:24,990 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:36:24,991 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:36:24,991 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:36:24,992 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:36:24,992 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:36:24,992 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:36:24,993 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:36:24,994 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:36:24,995 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:36:25,009 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:36:25,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:36:25,011 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:36:25,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:36:25,011 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:36:25,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:36:25,012 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:36:25,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:36:25,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:36:25,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:36:25,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:36:25,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:36:25,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:36:25,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:36:25,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:36:25,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:36:25,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:36:25,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:36:25,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:36:25,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:36:25,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:36:25,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:36:25,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:36:25,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:36:25,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:36:25,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:36:25,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:36:25,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:36:25,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:36:25,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:36:25,303 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:36:25,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:36:25,326 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:36:25,327 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:36:25,328 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:36:25,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-18 21:36:25,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9552748f/44dac7d9ae1d46d6917f82f8adab6e33/FLAGeeb4e06fd [2019-12-18 21:36:25,977 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:36:25,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_pso.opt.i [2019-12-18 21:36:25,994 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9552748f/44dac7d9ae1d46d6917f82f8adab6e33/FLAGeeb4e06fd [2019-12-18 21:36:26,257 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9552748f/44dac7d9ae1d46d6917f82f8adab6e33 [2019-12-18 21:36:26,267 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:36:26,269 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:36:26,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:26,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:36:26,274 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:36:26,275 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:26" (1/1) ... [2019-12-18 21:36:26,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:26, skipping insertion in model container [2019-12-18 21:36:26,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:36:26" (1/1) ... [2019-12-18 21:36:26,286 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:36:26,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:36:26,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:26,877 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:36:26,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:36:27,064 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:36:27,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27 WrapperNode [2019-12-18 21:36:27,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:36:27,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:27,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:36:27,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:36:27,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,094 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:36:27,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:36:27,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:36:27,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:36:27,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... [2019-12-18 21:36:27,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:36:27,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:36:27,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:36:27,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:36:27,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:36:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:36:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:36:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:36:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:36:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:36:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:36:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:36:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:36:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:36:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:36:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:36:27,239 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:36:27,957 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:36:27,957 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:36:27,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:27 BoogieIcfgContainer [2019-12-18 21:36:27,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:36:27,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:36:27,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:36:27,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:36:27,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:36:26" (1/3) ... [2019-12-18 21:36:27,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:27, skipping insertion in model container [2019-12-18 21:36:27,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:36:27" (2/3) ... [2019-12-18 21:36:27,969 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bbe8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:36:27, skipping insertion in model container [2019-12-18 21:36:27,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:36:27" (3/3) ... [2019-12-18 21:36:27,973 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_pso.opt.i [2019-12-18 21:36:27,984 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:36:27,984 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:36:28,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:36:28,004 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:36:28,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,051 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,052 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,053 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,061 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,062 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,093 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,094 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,095 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,096 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,101 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:36:28,134 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 21:36:28,155 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:36:28,155 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:36:28,155 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:36:28,156 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:36:28,156 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:36:28,156 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:36:28,156 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:36:28,156 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:36:28,173 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 21:36:28,175 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:28,252 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:28,252 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:28,267 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:36:28,288 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 21:36:28,329 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 21:36:28,329 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:36:28,337 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 21:36:28,354 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 21:36:28,355 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:36:31,698 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 21:36:31,808 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 21:36:31,844 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-18 21:36:31,845 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-18 21:36:31,848 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-18 21:36:32,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-18 21:36:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-18 21:36:32,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 21:36:32,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:32,275 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 21:36:32,276 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:32,282 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-18 21:36:32,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:32,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765415325] [2019-12-18 21:36:32,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:32,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765415325] [2019-12-18 21:36:32,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:32,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:36:32,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435756977] [2019-12-18 21:36:32,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:32,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:32,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:32,510 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-18 21:36:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:32,855 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-18 21:36:32,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:32,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 21:36:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:32,947 INFO L225 Difference]: With dead ends: 7864 [2019-12-18 21:36:32,948 INFO L226 Difference]: Without dead ends: 7408 [2019-12-18 21:36:32,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-18 21:36:33,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-18 21:36:33,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-18 21:36:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-18 21:36:33,346 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-18 21:36:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:33,346 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-18 21:36:33,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-18 21:36:33,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 21:36:33,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:33,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:33,351 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:33,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:33,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-18 21:36:33,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:33,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553647583] [2019-12-18 21:36:33,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:33,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553647583] [2019-12-18 21:36:33,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:33,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:33,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31490604] [2019-12-18 21:36:33,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:33,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:33,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:33,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:33,465 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-18 21:36:33,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:33,810 INFO L93 Difference]: Finished difference Result 11318 states and 34916 transitions. [2019-12-18 21:36:33,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:33,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 21:36:33,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:33,898 INFO L225 Difference]: With dead ends: 11318 [2019-12-18 21:36:33,898 INFO L226 Difference]: Without dead ends: 11311 [2019-12-18 21:36:33,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11311 states. [2019-12-18 21:36:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11311 to 10103. [2019-12-18 21:36:34,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10103 states. [2019-12-18 21:36:34,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10103 states to 10103 states and 31738 transitions. [2019-12-18 21:36:34,335 INFO L78 Accepts]: Start accepts. Automaton has 10103 states and 31738 transitions. Word has length 11 [2019-12-18 21:36:34,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:34,336 INFO L462 AbstractCegarLoop]: Abstraction has 10103 states and 31738 transitions. [2019-12-18 21:36:34,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:34,336 INFO L276 IsEmpty]: Start isEmpty. Operand 10103 states and 31738 transitions. [2019-12-18 21:36:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 21:36:34,342 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:34,342 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:34,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:34,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-18 21:36:34,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:34,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445921809] [2019-12-18 21:36:34,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:34,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445921809] [2019-12-18 21:36:34,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:34,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:34,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352213889] [2019-12-18 21:36:34,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:34,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:34,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:34,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:34,448 INFO L87 Difference]: Start difference. First operand 10103 states and 31738 transitions. Second operand 5 states. [2019-12-18 21:36:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:34,795 INFO L93 Difference]: Finished difference Result 14191 states and 43941 transitions. [2019-12-18 21:36:34,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:36:34,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 21:36:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:34,841 INFO L225 Difference]: With dead ends: 14191 [2019-12-18 21:36:34,841 INFO L226 Difference]: Without dead ends: 14191 [2019-12-18 21:36:34,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14191 states. [2019-12-18 21:36:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14191 to 11080. [2019-12-18 21:36:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11080 states. [2019-12-18 21:36:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 34779 transitions. [2019-12-18 21:36:35,857 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 34779 transitions. Word has length 14 [2019-12-18 21:36:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:35,858 INFO L462 AbstractCegarLoop]: Abstraction has 11080 states and 34779 transitions. [2019-12-18 21:36:35,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 34779 transitions. [2019-12-18 21:36:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:36:35,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:35,862 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:35,862 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash -827168568, now seen corresponding path program 1 times [2019-12-18 21:36:35,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:35,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159586589] [2019-12-18 21:36:35,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:35,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159586589] [2019-12-18 21:36:35,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:35,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:35,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108508729] [2019-12-18 21:36:35,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:35,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:35,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:35,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:35,941 INFO L87 Difference]: Start difference. First operand 11080 states and 34779 transitions. Second operand 3 states. [2019-12-18 21:36:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:35,999 INFO L93 Difference]: Finished difference Result 10482 states and 32382 transitions. [2019-12-18 21:36:35,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:35,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 21:36:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:36,023 INFO L225 Difference]: With dead ends: 10482 [2019-12-18 21:36:36,024 INFO L226 Difference]: Without dead ends: 10482 [2019-12-18 21:36:36,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10482 states. [2019-12-18 21:36:36,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10482 to 10402. [2019-12-18 21:36:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10402 states. [2019-12-18 21:36:36,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10402 states to 10402 states and 32150 transitions. [2019-12-18 21:36:36,415 INFO L78 Accepts]: Start accepts. Automaton has 10402 states and 32150 transitions. Word has length 16 [2019-12-18 21:36:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:36,415 INFO L462 AbstractCegarLoop]: Abstraction has 10402 states and 32150 transitions. [2019-12-18 21:36:36,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 10402 states and 32150 transitions. [2019-12-18 21:36:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:36:36,419 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:36,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:36,419 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1689443989, now seen corresponding path program 1 times [2019-12-18 21:36:36,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:36,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172241094] [2019-12-18 21:36:36,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:36,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:36,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172241094] [2019-12-18 21:36:36,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:36,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:36,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334510584] [2019-12-18 21:36:36,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:36,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:36,517 INFO L87 Difference]: Start difference. First operand 10402 states and 32150 transitions. Second operand 4 states. [2019-12-18 21:36:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:36,551 INFO L93 Difference]: Finished difference Result 2018 states and 4994 transitions. [2019-12-18 21:36:36,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:36:36,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:36:36,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:36,555 INFO L225 Difference]: With dead ends: 2018 [2019-12-18 21:36:36,555 INFO L226 Difference]: Without dead ends: 1434 [2019-12-18 21:36:36,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2019-12-18 21:36:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1434. [2019-12-18 21:36:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-12-18 21:36:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 3141 transitions. [2019-12-18 21:36:36,581 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 3141 transitions. Word has length 16 [2019-12-18 21:36:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:36,581 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 3141 transitions. [2019-12-18 21:36:36,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 3141 transitions. [2019-12-18 21:36:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 21:36:36,583 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:36,584 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:36,584 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-18 21:36:36,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:36,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173788584] [2019-12-18 21:36:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:36,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173788584] [2019-12-18 21:36:36,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:36,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:36:36,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461822652] [2019-12-18 21:36:36,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:36:36,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:36:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:36,720 INFO L87 Difference]: Start difference. First operand 1434 states and 3141 transitions. Second operand 6 states. [2019-12-18 21:36:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:37,110 INFO L93 Difference]: Finished difference Result 2226 states and 4691 transitions. [2019-12-18 21:36:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:36:37,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 21:36:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:37,114 INFO L225 Difference]: With dead ends: 2226 [2019-12-18 21:36:37,114 INFO L226 Difference]: Without dead ends: 2173 [2019-12-18 21:36:37,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:36:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2173 states. [2019-12-18 21:36:37,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2173 to 1404. [2019-12-18 21:36:37,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1404 states. [2019-12-18 21:36:37,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 3075 transitions. [2019-12-18 21:36:37,143 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 3075 transitions. Word has length 25 [2019-12-18 21:36:37,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:37,144 INFO L462 AbstractCegarLoop]: Abstraction has 1404 states and 3075 transitions. [2019-12-18 21:36:37,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:36:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 3075 transitions. [2019-12-18 21:36:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:36:37,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:37,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:37,147 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash -795565464, now seen corresponding path program 1 times [2019-12-18 21:36:37,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:37,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295938492] [2019-12-18 21:36:37,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:37,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295938492] [2019-12-18 21:36:37,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:37,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:36:37,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638330775] [2019-12-18 21:36:37,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:37,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:37,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:37,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:37,293 INFO L87 Difference]: Start difference. First operand 1404 states and 3075 transitions. Second operand 5 states. [2019-12-18 21:36:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:37,344 INFO L93 Difference]: Finished difference Result 739 states and 1600 transitions. [2019-12-18 21:36:37,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:36:37,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 21:36:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:37,345 INFO L225 Difference]: With dead ends: 739 [2019-12-18 21:36:37,346 INFO L226 Difference]: Without dead ends: 677 [2019-12-18 21:36:37,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-18 21:36:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 677. [2019-12-18 21:36:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-12-18 21:36:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1465 transitions. [2019-12-18 21:36:37,358 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1465 transitions. Word has length 27 [2019-12-18 21:36:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:37,358 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 1465 transitions. [2019-12-18 21:36:37,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1465 transitions. [2019-12-18 21:36:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:37,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:37,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:37,361 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1271151221, now seen corresponding path program 1 times [2019-12-18 21:36:37,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:37,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514641194] [2019-12-18 21:36:37,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:37,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514641194] [2019-12-18 21:36:37,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:37,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:37,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350741987] [2019-12-18 21:36:37,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:36:37,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:37,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:36:37,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:37,480 INFO L87 Difference]: Start difference. First operand 677 states and 1465 transitions. Second operand 7 states. [2019-12-18 21:36:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:37,807 INFO L93 Difference]: Finished difference Result 2064 states and 4333 transitions. [2019-12-18 21:36:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:36:37,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:36:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:37,809 INFO L225 Difference]: With dead ends: 2064 [2019-12-18 21:36:37,810 INFO L226 Difference]: Without dead ends: 1442 [2019-12-18 21:36:37,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:36:37,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-12-18 21:36:37,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 741. [2019-12-18 21:36:37,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-18 21:36:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1602 transitions. [2019-12-18 21:36:37,827 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1602 transitions. Word has length 52 [2019-12-18 21:36:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:37,828 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1602 transitions. [2019-12-18 21:36:37,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:36:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1602 transitions. [2019-12-18 21:36:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:37,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:37,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:37,833 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -196823289, now seen corresponding path program 2 times [2019-12-18 21:36:37,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:37,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158453038] [2019-12-18 21:36:37,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:37,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:37,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158453038] [2019-12-18 21:36:37,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:37,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:36:37,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091771213] [2019-12-18 21:36:37,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:36:37,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:36:37,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:36:37,954 INFO L87 Difference]: Start difference. First operand 741 states and 1602 transitions. Second operand 4 states. [2019-12-18 21:36:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:38,029 INFO L93 Difference]: Finished difference Result 1196 states and 2609 transitions. [2019-12-18 21:36:38,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:36:38,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 21:36:38,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:38,030 INFO L225 Difference]: With dead ends: 1196 [2019-12-18 21:36:38,030 INFO L226 Difference]: Without dead ends: 500 [2019-12-18 21:36:38,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-12-18 21:36:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-12-18 21:36:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-12-18 21:36:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 1092 transitions. [2019-12-18 21:36:38,039 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 1092 transitions. Word has length 52 [2019-12-18 21:36:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:38,039 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 1092 transitions. [2019-12-18 21:36:38,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:36:38,040 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 1092 transitions. [2019-12-18 21:36:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:38,041 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:38,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:38,042 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:38,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:38,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1967696263, now seen corresponding path program 3 times [2019-12-18 21:36:38,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:38,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911032212] [2019-12-18 21:36:38,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:38,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:38,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911032212] [2019-12-18 21:36:38,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:38,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:36:38,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150382847] [2019-12-18 21:36:38,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:36:38,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:36:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:36:38,146 INFO L87 Difference]: Start difference. First operand 500 states and 1092 transitions. Second operand 7 states. [2019-12-18 21:36:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:38,320 INFO L93 Difference]: Finished difference Result 992 states and 2078 transitions. [2019-12-18 21:36:38,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:36:38,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-18 21:36:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:38,322 INFO L225 Difference]: With dead ends: 992 [2019-12-18 21:36:38,322 INFO L226 Difference]: Without dead ends: 701 [2019-12-18 21:36:38,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:36:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-12-18 21:36:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 532. [2019-12-18 21:36:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-18 21:36:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 1152 transitions. [2019-12-18 21:36:38,333 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 1152 transitions. Word has length 52 [2019-12-18 21:36:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:38,333 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 1152 transitions. [2019-12-18 21:36:38,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:36:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 1152 transitions. [2019-12-18 21:36:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:38,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:38,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:38,335 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash 689321111, now seen corresponding path program 4 times [2019-12-18 21:36:38,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:38,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843891042] [2019-12-18 21:36:38,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:38,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843891042] [2019-12-18 21:36:38,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:38,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:36:38,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714488298] [2019-12-18 21:36:38,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:36:38,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:36:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:36:38,419 INFO L87 Difference]: Start difference. First operand 532 states and 1152 transitions. Second operand 5 states. [2019-12-18 21:36:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:38,825 INFO L93 Difference]: Finished difference Result 886 states and 1851 transitions. [2019-12-18 21:36:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:36:38,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-18 21:36:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:38,828 INFO L225 Difference]: With dead ends: 886 [2019-12-18 21:36:38,828 INFO L226 Difference]: Without dead ends: 862 [2019-12-18 21:36:38,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:36:38,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-12-18 21:36:38,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 714. [2019-12-18 21:36:38,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-12-18 21:36:38,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1537 transitions. [2019-12-18 21:36:38,841 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1537 transitions. Word has length 52 [2019-12-18 21:36:38,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:38,842 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1537 transitions. [2019-12-18 21:36:38,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:36:38,842 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1537 transitions. [2019-12-18 21:36:38,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 21:36:38,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:38,844 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:38,844 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:38,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:38,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1511703527, now seen corresponding path program 5 times [2019-12-18 21:36:38,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:38,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400861322] [2019-12-18 21:36:38,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:36:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:36:38,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400861322] [2019-12-18 21:36:38,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:36:38,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:36:38,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075520077] [2019-12-18 21:36:38,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:36:38,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:36:38,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:36:38,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:38,907 INFO L87 Difference]: Start difference. First operand 714 states and 1537 transitions. Second operand 3 states. [2019-12-18 21:36:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:36:38,956 INFO L93 Difference]: Finished difference Result 908 states and 1938 transitions. [2019-12-18 21:36:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:36:38,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 21:36:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:36:38,958 INFO L225 Difference]: With dead ends: 908 [2019-12-18 21:36:38,958 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 21:36:38,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:36:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 21:36:38,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 743. [2019-12-18 21:36:38,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2019-12-18 21:36:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1605 transitions. [2019-12-18 21:36:38,970 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1605 transitions. Word has length 52 [2019-12-18 21:36:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:36:38,970 INFO L462 AbstractCegarLoop]: Abstraction has 743 states and 1605 transitions. [2019-12-18 21:36:38,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:36:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1605 transitions. [2019-12-18 21:36:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 21:36:38,972 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:36:38,972 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:36:38,973 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:36:38,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:36:38,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-18 21:36:38,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:36:38,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106898757] [2019-12-18 21:36:38,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:36:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:36:39,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:36:39,085 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:36:39,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 |v_ULTIMATE.start_main_~#t1287~0.offset_19|) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p0_EAX~0_18) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= v_~x~0_10 0) (= v_~y$read_delayed~0_6 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_24| 1) |v_#valid_49|) (= 0 v_~y$r_buff1_thd0~0_25) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1287~0.base_24| 4) |v_#length_17|) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1287~0.base_24|) |v_ULTIMATE.start_main_~#t1287~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$w_buff0_used~0_106 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1287~0.base_24|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1287~0.base_24|) 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_~#t1287~0.offset=|v_ULTIMATE.start_main_~#t1287~0.offset_19|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_16, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ULTIMATE.start_main_~#t1287~0.base=|v_ULTIMATE.start_main_~#t1287~0.base_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_25|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_19|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1287~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1287~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1288~0.base, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1288~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:36:39,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1288~0.offset_11|) (not (= |v_ULTIMATE.start_main_~#t1288~0.base_13| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1288~0.base_13|) |v_ULTIMATE.start_main_~#t1288~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1288~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1288~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1288~0.base=|v_ULTIMATE.start_main_~#t1288~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1288~0.offset=|v_ULTIMATE.start_main_~#t1288~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1288~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1288~0.offset] because there is no mapped edge [2019-12-18 21:36:39,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-460796682)) (= ~y$r_buff1_thd1~0_Out-460796682 ~y$r_buff0_thd1~0_In-460796682) (= ~y$r_buff1_thd2~0_Out-460796682 ~y$r_buff0_thd2~0_In-460796682) (= ~x~0_In-460796682 ~__unbuffered_p0_EAX~0_Out-460796682) (= ~y$r_buff0_thd0~0_In-460796682 ~y$r_buff1_thd0~0_Out-460796682) (= 1 ~y$r_buff0_thd1~0_Out-460796682)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460796682, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-460796682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-460796682, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-460796682, ~x~0=~x~0_In-460796682} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-460796682, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-460796682, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-460796682, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-460796682, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-460796682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-460796682, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-460796682, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-460796682, ~x~0=~x~0_In-460796682} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:36:39,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In559021361 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In559021361 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out559021361|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In559021361 |P0Thread1of1ForFork0_#t~ite5_Out559021361|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559021361} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out559021361|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559021361} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:36:39,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1935061324 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1935061324| |P1Thread1of1ForFork1_#t~ite21_Out1935061324|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1935061324 256) 0))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1935061324 256))) (and .cse0 (= (mod ~y$w_buff1_used~0_In1935061324 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In1935061324 256)))) (= ~y$w_buff0_used~0_In1935061324 |P1Thread1of1ForFork1_#t~ite20_Out1935061324|) .cse1) (and (not .cse1) (= ~y$w_buff0_used~0_In1935061324 |P1Thread1of1ForFork1_#t~ite21_Out1935061324|) (= |P1Thread1of1ForFork1_#t~ite20_In1935061324| |P1Thread1of1ForFork1_#t~ite20_Out1935061324|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1935061324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935061324, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1935061324|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1935061324, ~weak$$choice2~0=~weak$$choice2~0_In1935061324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935061324} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1935061324, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1935061324, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1935061324|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1935061324, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1935061324|, ~weak$$choice2~0=~weak$$choice2~0_In1935061324, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1935061324} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 21:36:39,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-896628610 256))) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In-896628610 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-896628610 256) 0)) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-896628610| |P1Thread1of1ForFork1_#t~ite23_Out-896628610|)) (.cse0 (= (mod ~weak$$choice2~0_In-896628610 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-896628610 256) 0))) (or (and (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_In-896628610| |P1Thread1of1ForFork1_#t~ite23_Out-896628610|) (= |P1Thread1of1ForFork1_#t~ite24_Out-896628610| ~y$w_buff1_used~0_In-896628610)) (and (= ~y$w_buff1_used~0_In-896628610 |P1Thread1of1ForFork1_#t~ite23_Out-896628610|) (or .cse1 (and .cse2 .cse3) (and .cse3 .cse4)) .cse5 .cse0)) (= |P1Thread1of1ForFork1_#t~ite22_In-896628610| |P1Thread1of1ForFork1_#t~ite22_Out-896628610|)) (let ((.cse6 (not .cse3))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-896628610| |P1Thread1of1ForFork1_#t~ite23_Out-896628610|) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-896628610|) (not .cse1) (or (not .cse4) .cse6) (or (not .cse2) .cse6) .cse5 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-896628610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896628610, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-896628610, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-896628610|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-896628610|, ~weak$$choice2~0=~weak$$choice2~0_In-896628610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896628610} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-896628610, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896628610, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-896628610, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-896628610|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-896628610|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-896628610|, ~weak$$choice2~0=~weak$$choice2~0_In-896628610, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-896628610} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 21:36:39,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-18 21:36:39,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In904453096 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In904453096 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In904453096 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In904453096 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out904453096|)) (and (= ~y$w_buff1_used~0_In904453096 |P0Thread1of1ForFork0_#t~ite6_Out904453096|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In904453096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904453096, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In904453096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904453096} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out904453096|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In904453096, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904453096, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In904453096, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904453096} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:36:39,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In1378451645 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1378451645 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out1378451645)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In1378451645 ~y$r_buff0_thd1~0_Out1378451645)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1378451645, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1378451645} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1378451645, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1378451645|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1378451645} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:36:39,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-1851549251| |P1Thread1of1ForFork1_#t~ite30_Out-1851549251|)) (.cse5 (= (mod ~y$r_buff1_thd2~0_In-1851549251 256) 0)) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1851549251 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1851549251 256) 0)) (.cse4 (= (mod ~y$w_buff1_used~0_In-1851549251 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1851549251 256) 0))) (or (and (or (and (= ~y$r_buff1_thd2~0_In-1851549251 |P1Thread1of1ForFork1_#t~ite30_Out-1851549251|) (= |P1Thread1of1ForFork1_#t~ite29_In-1851549251| |P1Thread1of1ForFork1_#t~ite29_Out-1851549251|) (not .cse0)) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-1851549251| ~y$r_buff1_thd2~0_In-1851549251) .cse0 (or .cse2 (and .cse3 .cse4) (and .cse3 .cse5)))) (= |P1Thread1of1ForFork1_#t~ite28_In-1851549251| |P1Thread1of1ForFork1_#t~ite28_Out-1851549251|)) (let ((.cse6 (not .cse3))) (and .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-1851549251| |P1Thread1of1ForFork1_#t~ite28_Out-1851549251|) (or (not .cse5) .cse6) .cse0 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite28_Out-1851549251| 0) (or .cse6 (not .cse4)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1851549251, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1851549251|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1851549251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1851549251, ~weak$$choice2~0=~weak$$choice2~0_In-1851549251, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1851549251|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1851549251} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1851549251, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1851549251|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1851549251|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1851549251, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1851549251, ~weak$$choice2~0=~weak$$choice2~0_In-1851549251, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1851549251|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1851549251} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 21:36:39,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1246383888 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1246383888 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1246383888 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1246383888 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1246383888|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In-1246383888 |P0Thread1of1ForFork0_#t~ite8_Out-1246383888|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1246383888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246383888, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1246383888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1246383888} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1246383888, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1246383888, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1246383888|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1246383888, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1246383888} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:36:39,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 21:36:39,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1285999233 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1285999233 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-1285999233 |P1Thread1of1ForFork1_#t~ite32_Out-1285999233|)) (and (= ~y$w_buff1~0_In-1285999233 |P1Thread1of1ForFork1_#t~ite32_Out-1285999233|) (not .cse1) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285999233, ~y$w_buff1~0=~y$w_buff1~0_In-1285999233, ~y~0=~y~0_In-1285999233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285999233} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1285999233, ~y$w_buff1~0=~y$w_buff1~0_In-1285999233, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1285999233|, ~y~0=~y~0_In-1285999233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1285999233} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 21:36:39,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 21:36:39,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2119036253 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2119036253 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2119036253 |P1Thread1of1ForFork1_#t~ite34_Out-2119036253|)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2119036253|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119036253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2119036253} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119036253, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2119036253, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2119036253|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 21:36:39,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-328562032 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-328562032 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-328562032 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-328562032 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-328562032| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-328562032 |P1Thread1of1ForFork1_#t~ite35_Out-328562032|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-328562032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-328562032, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-328562032, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-328562032} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-328562032, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-328562032, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-328562032, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-328562032|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-328562032} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 21:36:39,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1395166954 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1395166954 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1395166954| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1395166954| ~y$r_buff0_thd2~0_In-1395166954)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1395166954} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1395166954, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1395166954|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 21:36:39,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1220971812 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1220971812 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1220971812 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1220971812 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1220971812|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1220971812 |P1Thread1of1ForFork1_#t~ite37_Out-1220971812|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1220971812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1220971812, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1220971812} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1220971812, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1220971812, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1220971812, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1220971812|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1220971812} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:36:39,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 21:36:39,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 21:36:39,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:36:39,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1909330722 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1909330722 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1909330722| ~y$w_buff1~0_In1909330722) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1909330722| ~y~0_In1909330722)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1909330722, ~y~0=~y~0_In1909330722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909330722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909330722} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1909330722|, ~y$w_buff1~0=~y$w_buff1~0_In1909330722, ~y~0=~y~0_In1909330722, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1909330722, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1909330722} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 21:36:39,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 21:36:39,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1944397223 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1944397223 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1944397223|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1944397223 |ULTIMATE.start_main_#t~ite42_Out1944397223|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1944397223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944397223} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1944397223, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1944397223, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1944397223|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:36:39,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In2124821985 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2124821985 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In2124821985 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2124821985 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out2124821985| ~y$w_buff1_used~0_In2124821985) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out2124821985| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124821985, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124821985, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124821985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124821985} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2124821985, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124821985, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2124821985|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124821985, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124821985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 21:36:39,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1360874274 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1360874274 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1360874274| ~y$r_buff0_thd0~0_In-1360874274) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1360874274| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360874274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1360874274} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1360874274, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1360874274, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1360874274|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:36:39,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1878965937 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1878965937 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1878965937 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1878965937 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1878965937| ~y$r_buff1_thd0~0_In1878965937) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite45_Out1878965937| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1878965937, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878965937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878965937, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878965937} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1878965937, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878965937, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878965937, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1878965937|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878965937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:36:39,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EAX~0_8) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:36:39,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:36:39 BasicIcfg [2019-12-18 21:36:39,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:36:39,190 INFO L168 Benchmark]: Toolchain (without parser) took 12921.82 ms. Allocated memory was 142.1 MB in the beginning and 538.4 MB in the end (delta: 396.4 MB). Free memory was 98.1 MB in the beginning and 216.2 MB in the end (delta: -118.1 MB). Peak memory consumption was 278.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,191 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.75 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 97.7 MB in the beginning and 152.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,194 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 199.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,194 INFO L168 Benchmark]: Boogie Preprocessor took 41.02 ms. Allocated memory is still 199.8 MB. Free memory was 149.3 MB in the beginning and 147.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,195 INFO L168 Benchmark]: RCFGBuilder took 791.78 ms. Allocated memory is still 199.8 MB. Free memory was 147.1 MB in the beginning and 102.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,196 INFO L168 Benchmark]: TraceAbstraction took 11227.71 ms. Allocated memory was 199.8 MB in the beginning and 538.4 MB in the end (delta: 338.7 MB). Free memory was 101.8 MB in the beginning and 216.2 MB in the end (delta: -114.4 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:36:39,208 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.43 ms. Allocated memory is still 142.1 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.75 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 97.7 MB in the beginning and 152.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.96 ms. Allocated memory is still 199.8 MB. Free memory was 152.1 MB in the beginning and 149.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.02 ms. Allocated memory is still 199.8 MB. Free memory was 149.3 MB in the beginning and 147.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 791.78 ms. Allocated memory is still 199.8 MB. Free memory was 147.1 MB in the beginning and 102.5 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11227.71 ms. Allocated memory was 199.8 MB in the beginning and 538.4 MB in the end (delta: 338.7 MB). Free memory was 101.8 MB in the beginning and 216.2 MB in the end (delta: -114.4 MB). Peak memory consumption was 224.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4625 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1287, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1288, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.9s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1470 SDtfs, 1647 SDslu, 2991 SDs, 0 SdLazy, 1315 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 17 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11080occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 6351 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 425 NumberOfCodeBlocks, 425 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 41838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...