/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/mix022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 20:42:58,940 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 20:42:58,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 20:42:58,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 20:42:58,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 20:42:58,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 20:42:58,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 20:42:58,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 20:42:58,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 20:42:58,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 20:42:58,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 20:42:58,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 20:42:58,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 20:42:58,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 20:42:58,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 20:42:58,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 20:42:58,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 20:42:58,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 20:42:58,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 20:42:58,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 20:42:58,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 20:42:58,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 20:42:58,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 20:42:58,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 20:42:58,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 20:42:58,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 20:42:58,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 20:42:58,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 20:42:58,980 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 20:42:58,981 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 20:42:58,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 20:42:58,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 20:42:58,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 20:42:58,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 20:42:58,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 20:42:58,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 20:42:58,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 20:42:58,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 20:42:58,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 20:42:58,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 20:42:58,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 20:42:58,988 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 20:42:59,007 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 20:42:59,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 20:42:59,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 20:42:59,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 20:42:59,012 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 20:42:59,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 20:42:59,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 20:42:59,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 20:42:59,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 20:42:59,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 20:42:59,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 20:42:59,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 20:42:59,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 20:42:59,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 20:42:59,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 20:42:59,014 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 20:42:59,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 20:42:59,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 20:42:59,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 20:42:59,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 20:42:59,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 20:42:59,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 20:42:59,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 20:42:59,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 20:42:59,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 20:42:59,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 20:42:59,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 20:42:59,017 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 20:42:59,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 20:42:59,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 20:42:59,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 20:42:59,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 20:42:59,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 20:42:59,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 20:42:59,308 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 20:42:59,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-18 20:42:59,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df19260cc/388c83990d8a4431b318cbbf8daad3c4/FLAG62cf118d1 [2019-12-18 20:42:59,970 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 20:42:59,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix022_rmo.opt.i [2019-12-18 20:42:59,992 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df19260cc/388c83990d8a4431b318cbbf8daad3c4/FLAG62cf118d1 [2019-12-18 20:43:00,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df19260cc/388c83990d8a4431b318cbbf8daad3c4 [2019-12-18 20:43:00,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 20:43:00,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 20:43:00,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:00,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 20:43:00,265 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 20:43:00,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:00" (1/1) ... [2019-12-18 20:43:00,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b75db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:00, skipping insertion in model container [2019-12-18 20:43:00,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:43:00" (1/1) ... [2019-12-18 20:43:00,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 20:43:00,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 20:43:00,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:00,903 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 20:43:00,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 20:43:01,044 INFO L208 MainTranslator]: Completed translation [2019-12-18 20:43:01,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01 WrapperNode [2019-12-18 20:43:01,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 20:43:01,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:01,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 20:43:01,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 20:43:01,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,105 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 20:43:01,106 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 20:43:01,106 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 20:43:01,106 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 20:43:01,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (1/1) ... [2019-12-18 20:43:01,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 20:43:01,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 20:43:01,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 20:43:01,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 20:43:01,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (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 20:43:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 20:43:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 20:43:01,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 20:43:01,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 20:43:01,214 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 20:43:01,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 20:43:01,214 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 20:43:01,214 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 20:43:01,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 20:43:01,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 20:43:01,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 20:43:01,217 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 20:43:01,934 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 20:43:01,934 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 20:43:01,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:01 BoogieIcfgContainer [2019-12-18 20:43:01,936 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 20:43:01,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 20:43:01,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 20:43:01,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 20:43:01,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:43:00" (1/3) ... [2019-12-18 20:43:01,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be506be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:01, skipping insertion in model container [2019-12-18 20:43:01,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:43:01" (2/3) ... [2019-12-18 20:43:01,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be506be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:43:01, skipping insertion in model container [2019-12-18 20:43:01,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:43:01" (3/3) ... [2019-12-18 20:43:01,949 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-18 20:43:01,960 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 20:43:01,960 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 20:43:01,976 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 20:43:01,977 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 20:43:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,031 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,032 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,032 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,033 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,033 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,034 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,043 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,045 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,046 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,047 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,049 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,075 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,093 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,097 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,102 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,102 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,103 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,104 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,105 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 20:43:02,130 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 20:43:02,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 20:43:02,148 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 20:43:02,148 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 20:43:02,148 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 20:43:02,148 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 20:43:02,148 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 20:43:02,148 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 20:43:02,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 20:43:02,165 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 20:43:02,168 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:43:02,256 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:43:02,257 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:02,271 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 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:43:02,290 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 20:43:02,330 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 20:43:02,331 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 20:43:02,341 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 340 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 20:43:02,356 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 20:43:02,357 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 20:43:05,665 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 20:43:05,777 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-18 20:43:05,801 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55625 [2019-12-18 20:43:05,802 INFO L214 etLargeBlockEncoding]: Total number of compositions: 98 [2019-12-18 20:43:05,805 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 89 transitions [2019-12-18 20:43:06,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9482 states. [2019-12-18 20:43:06,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9482 states. [2019-12-18 20:43:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 20:43:06,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:06,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 20:43:06,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:06,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:06,335 INFO L82 PathProgramCache]: Analyzing trace with hash 786448, now seen corresponding path program 1 times [2019-12-18 20:43:06,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:06,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357526320] [2019-12-18 20:43:06,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:06,595 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 20:43:06,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357526320] [2019-12-18 20:43:06,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:06,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 20:43:06,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499452787] [2019-12-18 20:43:06,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:06,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:06,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:06,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:06,622 INFO L87 Difference]: Start difference. First operand 9482 states. Second operand 3 states. [2019-12-18 20:43:06,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:06,935 INFO L93 Difference]: Finished difference Result 9196 states and 29676 transitions. [2019-12-18 20:43:06,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:06,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 20:43:06,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:07,038 INFO L225 Difference]: With dead ends: 9196 [2019-12-18 20:43:07,038 INFO L226 Difference]: Without dead ends: 8650 [2019-12-18 20:43:07,040 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 20:43:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8650 states. [2019-12-18 20:43:07,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8650 to 8650. [2019-12-18 20:43:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8650 states. [2019-12-18 20:43:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8650 states to 8650 states and 27866 transitions. [2019-12-18 20:43:07,624 INFO L78 Accepts]: Start accepts. Automaton has 8650 states and 27866 transitions. Word has length 3 [2019-12-18 20:43:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:07,625 INFO L462 AbstractCegarLoop]: Abstraction has 8650 states and 27866 transitions. [2019-12-18 20:43:07,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 8650 states and 27866 transitions. [2019-12-18 20:43:07,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 20:43:07,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:07,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:07,629 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:07,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1848805564, now seen corresponding path program 1 times [2019-12-18 20:43:07,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797812131] [2019-12-18 20:43:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:07,757 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 20:43:07,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797812131] [2019-12-18 20:43:07,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:07,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 20:43:07,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529483093] [2019-12-18 20:43:07,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:07,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:07,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:07,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:07,761 INFO L87 Difference]: Start difference. First operand 8650 states and 27866 transitions. Second operand 4 states. [2019-12-18 20:43:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:07,831 INFO L93 Difference]: Finished difference Result 1940 states and 4887 transitions. [2019-12-18 20:43:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 20:43:07,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 20:43:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:07,840 INFO L225 Difference]: With dead ends: 1940 [2019-12-18 20:43:07,840 INFO L226 Difference]: Without dead ends: 1410 [2019-12-18 20:43:07,841 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 20:43:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-12-18 20:43:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2019-12-18 20:43:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-12-18 20:43:07,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 3190 transitions. [2019-12-18 20:43:07,878 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 3190 transitions. Word has length 11 [2019-12-18 20:43:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:07,879 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 3190 transitions. [2019-12-18 20:43:07,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:07,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 3190 transitions. [2019-12-18 20:43:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 20:43:07,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:07,881 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:07,881 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1479508104, now seen corresponding path program 1 times [2019-12-18 20:43:07,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:07,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049649741] [2019-12-18 20:43:07,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:08,007 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 20:43:08,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049649741] [2019-12-18 20:43:08,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:08,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:08,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088774438] [2019-12-18 20:43:08,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:08,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:08,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:08,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:08,013 INFO L87 Difference]: Start difference. First operand 1410 states and 3190 transitions. Second operand 4 states. [2019-12-18 20:43:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:08,277 INFO L93 Difference]: Finished difference Result 1718 states and 3820 transitions. [2019-12-18 20:43:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:08,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 20:43:08,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:08,289 INFO L225 Difference]: With dead ends: 1718 [2019-12-18 20:43:08,289 INFO L226 Difference]: Without dead ends: 1718 [2019-12-18 20:43:08,290 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 20:43:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-12-18 20:43:08,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1654. [2019-12-18 20:43:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-18 20:43:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3696 transitions. [2019-12-18 20:43:08,344 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3696 transitions. Word has length 14 [2019-12-18 20:43:08,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:08,345 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3696 transitions. [2019-12-18 20:43:08,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3696 transitions. [2019-12-18 20:43:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 20:43:08,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:08,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:08,350 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:08,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash 935036584, now seen corresponding path program 1 times [2019-12-18 20:43:08,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:08,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207618660] [2019-12-18 20:43:08,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:08,523 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 20:43:08,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207618660] [2019-12-18 20:43:08,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:08,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:08,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986099715] [2019-12-18 20:43:08,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:08,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:08,530 INFO L87 Difference]: Start difference. First operand 1654 states and 3696 transitions. Second operand 6 states. [2019-12-18 20:43:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:09,242 INFO L93 Difference]: Finished difference Result 4552 states and 10047 transitions. [2019-12-18 20:43:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:43:09,243 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-18 20:43:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:09,268 INFO L225 Difference]: With dead ends: 4552 [2019-12-18 20:43:09,269 INFO L226 Difference]: Without dead ends: 4517 [2019-12-18 20:43:09,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:43:09,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4517 states. [2019-12-18 20:43:09,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4517 to 2214. [2019-12-18 20:43:09,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2019-12-18 20:43:09,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 5000 transitions. [2019-12-18 20:43:09,354 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 5000 transitions. Word has length 25 [2019-12-18 20:43:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:09,354 INFO L462 AbstractCegarLoop]: Abstraction has 2214 states and 5000 transitions. [2019-12-18 20:43:09,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 5000 transitions. [2019-12-18 20:43:09,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:43:09,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:09,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:09,358 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:09,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:09,358 INFO L82 PathProgramCache]: Analyzing trace with hash -453087513, now seen corresponding path program 1 times [2019-12-18 20:43:09,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:09,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722710447] [2019-12-18 20:43:09,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:09,406 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 20:43:09,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722710447] [2019-12-18 20:43:09,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:09,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:09,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022008486] [2019-12-18 20:43:09,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:09,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:09,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:09,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:09,408 INFO L87 Difference]: Start difference. First operand 2214 states and 5000 transitions. Second operand 3 states. [2019-12-18 20:43:09,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:09,443 INFO L93 Difference]: Finished difference Result 3872 states and 8779 transitions. [2019-12-18 20:43:09,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:09,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 20:43:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:09,456 INFO L225 Difference]: With dead ends: 3872 [2019-12-18 20:43:09,462 INFO L226 Difference]: Without dead ends: 2030 [2019-12-18 20:43:09,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:09,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2019-12-18 20:43:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 2010. [2019-12-18 20:43:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-18 20:43:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4452 transitions. [2019-12-18 20:43:09,508 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4452 transitions. Word has length 26 [2019-12-18 20:43:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:09,508 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4452 transitions. [2019-12-18 20:43:09,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4452 transitions. [2019-12-18 20:43:09,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 20:43:09,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:09,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:09,512 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:09,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:09,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1584123616, now seen corresponding path program 1 times [2019-12-18 20:43:09,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:09,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668403552] [2019-12-18 20:43:09,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:09,645 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 20:43:09,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668403552] [2019-12-18 20:43:09,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:09,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:09,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118234523] [2019-12-18 20:43:09,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 20:43:09,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:09,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 20:43:09,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 20:43:09,647 INFO L87 Difference]: Start difference. First operand 2010 states and 4452 transitions. Second operand 6 states. [2019-12-18 20:43:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:10,139 INFO L93 Difference]: Finished difference Result 3736 states and 7983 transitions. [2019-12-18 20:43:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 20:43:10,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-18 20:43:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:10,150 INFO L225 Difference]: With dead ends: 3736 [2019-12-18 20:43:10,150 INFO L226 Difference]: Without dead ends: 3707 [2019-12-18 20:43:10,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 20:43:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-12-18 20:43:10,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 1982. [2019-12-18 20:43:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-18 20:43:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4405 transitions. [2019-12-18 20:43:10,210 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4405 transitions. Word has length 26 [2019-12-18 20:43:10,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:10,211 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4405 transitions. [2019-12-18 20:43:10,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 20:43:10,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4405 transitions. [2019-12-18 20:43:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 20:43:10,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:10,214 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 20:43:10,214 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:10,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1377848575, now seen corresponding path program 1 times [2019-12-18 20:43:10,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:10,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140025086] [2019-12-18 20:43:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:10,289 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 20:43:10,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140025086] [2019-12-18 20:43:10,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:10,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 20:43:10,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733640334] [2019-12-18 20:43:10,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:10,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:10,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:10,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:10,291 INFO L87 Difference]: Start difference. First operand 1982 states and 4405 transitions. Second operand 5 states. [2019-12-18 20:43:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:10,910 INFO L93 Difference]: Finished difference Result 2989 states and 6529 transitions. [2019-12-18 20:43:10,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 20:43:10,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 20:43:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:10,919 INFO L225 Difference]: With dead ends: 2989 [2019-12-18 20:43:10,919 INFO L226 Difference]: Without dead ends: 2989 [2019-12-18 20:43:10,920 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 20:43:10,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2989 states. [2019-12-18 20:43:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2553. [2019-12-18 20:43:10,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-12-18 20:43:10,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 5641 transitions. [2019-12-18 20:43:10,977 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 5641 transitions. Word has length 27 [2019-12-18 20:43:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:10,978 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 5641 transitions. [2019-12-18 20:43:10,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 5641 transitions. [2019-12-18 20:43:10,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 20:43:10,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:10,982 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] [2019-12-18 20:43:10,982 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1012801820, now seen corresponding path program 1 times [2019-12-18 20:43:10,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:10,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540306530] [2019-12-18 20:43:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:11,060 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 20:43:11,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540306530] [2019-12-18 20:43:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:11,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89020303] [2019-12-18 20:43:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 20:43:11,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:11,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 20:43:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 20:43:11,062 INFO L87 Difference]: Start difference. First operand 2553 states and 5641 transitions. Second operand 5 states. [2019-12-18 20:43:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:11,105 INFO L93 Difference]: Finished difference Result 1549 states and 3250 transitions. [2019-12-18 20:43:11,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:11,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 20:43:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:11,110 INFO L225 Difference]: With dead ends: 1549 [2019-12-18 20:43:11,110 INFO L226 Difference]: Without dead ends: 1302 [2019-12-18 20:43:11,110 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 20:43:11,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2019-12-18 20:43:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1207. [2019-12-18 20:43:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2019-12-18 20:43:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 2612 transitions. [2019-12-18 20:43:11,135 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 2612 transitions. Word has length 28 [2019-12-18 20:43:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:11,135 INFO L462 AbstractCegarLoop]: Abstraction has 1207 states and 2612 transitions. [2019-12-18 20:43:11,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 20:43:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 2612 transitions. [2019-12-18 20:43:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:43:11,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:11,139 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:11,140 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:11,140 INFO L82 PathProgramCache]: Analyzing trace with hash -257669256, now seen corresponding path program 1 times [2019-12-18 20:43:11,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:11,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66393336] [2019-12-18 20:43:11,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:11,229 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 20:43:11,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66393336] [2019-12-18 20:43:11,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:11,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 20:43:11,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577850799] [2019-12-18 20:43:11,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 20:43:11,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 20:43:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 20:43:11,231 INFO L87 Difference]: Start difference. First operand 1207 states and 2612 transitions. Second operand 7 states. [2019-12-18 20:43:11,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:11,400 INFO L93 Difference]: Finished difference Result 2115 states and 4473 transitions. [2019-12-18 20:43:11,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 20:43:11,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 20:43:11,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:11,404 INFO L225 Difference]: With dead ends: 2115 [2019-12-18 20:43:11,405 INFO L226 Difference]: Without dead ends: 1423 [2019-12-18 20:43:11,405 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 20:43:11,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2019-12-18 20:43:11,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1214. [2019-12-18 20:43:11,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2019-12-18 20:43:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 2602 transitions. [2019-12-18 20:43:11,431 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 2602 transitions. Word has length 51 [2019-12-18 20:43:11,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:11,432 INFO L462 AbstractCegarLoop]: Abstraction has 1214 states and 2602 transitions. [2019-12-18 20:43:11,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 20:43:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 2602 transitions. [2019-12-18 20:43:11,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 20:43:11,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:11,437 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:11,437 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1643045960, now seen corresponding path program 2 times [2019-12-18 20:43:11,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:11,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491453995] [2019-12-18 20:43:11,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:11,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:11,577 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 20:43:11,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491453995] [2019-12-18 20:43:11,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:11,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:11,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264884821] [2019-12-18 20:43:11,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:11,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:11,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:11,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:11,580 INFO L87 Difference]: Start difference. First operand 1214 states and 2602 transitions. Second operand 3 states. [2019-12-18 20:43:11,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:11,642 INFO L93 Difference]: Finished difference Result 1587 states and 3364 transitions. [2019-12-18 20:43:11,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:11,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 20:43:11,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:11,646 INFO L225 Difference]: With dead ends: 1587 [2019-12-18 20:43:11,646 INFO L226 Difference]: Without dead ends: 1587 [2019-12-18 20:43:11,647 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 20:43:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2019-12-18 20:43:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1262. [2019-12-18 20:43:11,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-18 20:43:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2714 transitions. [2019-12-18 20:43:11,675 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2714 transitions. Word has length 51 [2019-12-18 20:43:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:11,675 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2714 transitions. [2019-12-18 20:43:11,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2714 transitions. [2019-12-18 20:43:11,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:11,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:11,679 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 20:43:11,679 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 730196883, now seen corresponding path program 1 times [2019-12-18 20:43:11,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:11,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53678504] [2019-12-18 20:43:11,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:11,843 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 20:43:11,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53678504] [2019-12-18 20:43:11,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:11,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 20:43:11,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259026270] [2019-12-18 20:43:11,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 20:43:11,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 20:43:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 20:43:11,846 INFO L87 Difference]: Start difference. First operand 1262 states and 2714 transitions. Second operand 8 states. [2019-12-18 20:43:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:13,403 INFO L93 Difference]: Finished difference Result 2653 states and 5478 transitions. [2019-12-18 20:43:13,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 20:43:13,404 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-18 20:43:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:13,411 INFO L225 Difference]: With dead ends: 2653 [2019-12-18 20:43:13,411 INFO L226 Difference]: Without dead ends: 2653 [2019-12-18 20:43:13,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2019-12-18 20:43:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2653 states. [2019-12-18 20:43:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2653 to 1286. [2019-12-18 20:43:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1286 states. [2019-12-18 20:43:13,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2747 transitions. [2019-12-18 20:43:13,457 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2747 transitions. Word has length 52 [2019-12-18 20:43:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:13,458 INFO L462 AbstractCegarLoop]: Abstraction has 1286 states and 2747 transitions. [2019-12-18 20:43:13,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 20:43:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2747 transitions. [2019-12-18 20:43:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:13,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:13,462 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:13,463 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash -539154384, now seen corresponding path program 1 times [2019-12-18 20:43:13,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:13,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157503561] [2019-12-18 20:43:13,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:13,525 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 20:43:13,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157503561] [2019-12-18 20:43:13,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:13,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 20:43:13,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755601614] [2019-12-18 20:43:13,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 20:43:13,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:13,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 20:43:13,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 20:43:13,527 INFO L87 Difference]: Start difference. First operand 1286 states and 2747 transitions. Second operand 4 states. [2019-12-18 20:43:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:13,761 INFO L93 Difference]: Finished difference Result 1970 states and 4215 transitions. [2019-12-18 20:43:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 20:43:13,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-18 20:43:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:13,765 INFO L225 Difference]: With dead ends: 1970 [2019-12-18 20:43:13,765 INFO L226 Difference]: Without dead ends: 1970 [2019-12-18 20:43:13,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:43:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2019-12-18 20:43:13,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1316. [2019-12-18 20:43:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-12-18 20:43:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 2818 transitions. [2019-12-18 20:43:13,800 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 2818 transitions. Word has length 52 [2019-12-18 20:43:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:13,801 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 2818 transitions. [2019-12-18 20:43:13,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 20:43:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 2818 transitions. [2019-12-18 20:43:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 20:43:13,804 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:13,804 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 20:43:13,805 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:13,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:13,805 INFO L82 PathProgramCache]: Analyzing trace with hash -930930685, now seen corresponding path program 2 times [2019-12-18 20:43:13,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:13,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199668260] [2019-12-18 20:43:13,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 20:43:13,874 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 20:43:13,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199668260] [2019-12-18 20:43:13,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 20:43:13,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 20:43:13,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719154567] [2019-12-18 20:43:13,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 20:43:13,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 20:43:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 20:43:13,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 20:43:13,876 INFO L87 Difference]: Start difference. First operand 1316 states and 2818 transitions. Second operand 3 states. [2019-12-18 20:43:13,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 20:43:13,890 INFO L93 Difference]: Finished difference Result 1315 states and 2816 transitions. [2019-12-18 20:43:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 20:43:13,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-18 20:43:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 20:43:13,893 INFO L225 Difference]: With dead ends: 1315 [2019-12-18 20:43:13,893 INFO L226 Difference]: Without dead ends: 1315 [2019-12-18 20:43:13,893 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 20:43:13,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2019-12-18 20:43:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 935. [2019-12-18 20:43:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-12-18 20:43:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 2029 transitions. [2019-12-18 20:43:13,913 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 2029 transitions. Word has length 52 [2019-12-18 20:43:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 20:43:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 935 states and 2029 transitions. [2019-12-18 20:43:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 20:43:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 2029 transitions. [2019-12-18 20:43:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-18 20:43:13,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 20:43:13,917 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 20:43:13,917 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 20:43:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 20:43:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash -87902062, now seen corresponding path program 1 times [2019-12-18 20:43:13,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 20:43:13,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322324773] [2019-12-18 20:43:13,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 20:43:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 20:43:14,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 20:43:14,113 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 20:43:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd2~0_77 0) (= 0 v_~__unbuffered_cnt~0_13) (= 0 v_~__unbuffered_p1_EAX~0_12) (= 0 v_~y$r_buff1_thd2~0_53) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t595~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t595~0.base_22|) |v_ULTIMATE.start_main_~#t595~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~y$r_buff1_thd0~0_22) (= 0 v_~weak$$choice0~0_5) (= v_~y$r_buff0_thd0~0_24 0) (= 0 v_~y$w_buff1~0_25) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_22|) (= 0 v_~y$r_buff1_thd1~0_21) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t595~0.base_22| 4) |v_#length_17|) (= v_~y$w_buff0_used~0_103 0) (= 0 v_~y$flush_delayed~0_14) (= |v_ULTIMATE.start_main_~#t595~0.offset_17| 0) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_22| 1)) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_22|)) (= v_~y$read_delayed~0_6 0) (= v_~y$mem_tmp~0_11 0) (= v_~x~0_17 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard1~0_15 0) (= |v_#NULL.offset_4| 0) (= v_~y$w_buff1_used~0_67 0) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard0~0_11 0) (= v_~y~0_26 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_18|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_20|, 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_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_14, #length=|v_#length_17|, ~y~0=v_~y~0_26, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_5, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_25, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_24, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_77, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_17, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_67} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, 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, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 20:43:14,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 20:43:14,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_11) (= 1 v_~x~0_5) (= v_~y$r_buff0_thd2~0_55 v_~y$r_buff1_thd2~0_33) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd1~0_16 1) (= v_~y$r_buff0_thd0~0_15 v_~y$r_buff1_thd0~0_10)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_16, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x~0=v_~x~0_5, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 20:43:14,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1318996025 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1318996025 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1318996025| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1318996025| ~y$w_buff0_used~0_In1318996025) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1318996025, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1318996025} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1318996025|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1318996025, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1318996025} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 20:43:14,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1067640911 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-1067640911 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1067640911 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1067640911 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1067640911| ~y$w_buff1_used~0_In-1067640911)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1067640911| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1067640911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067640911, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1067640911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067640911} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1067640911|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1067640911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067640911, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1067640911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067640911} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 20:43:14,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1188061889 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1188061889 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out1188061889 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_Out1188061889 ~y$r_buff0_thd1~0_In1188061889)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1188061889, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1188061889} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1188061889, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1188061889|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1188061889} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 20:43:14,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2133562433 256)))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2133562433 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In2133562433 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In2133562433 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2133562433 256))))) (= |P1Thread1of1ForFork1_#t~ite14_Out2133562433| |P1Thread1of1ForFork1_#t~ite15_Out2133562433|) .cse1 (= |P1Thread1of1ForFork1_#t~ite14_Out2133562433| ~y$w_buff0~0_In2133562433)) (and (= |P1Thread1of1ForFork1_#t~ite14_In2133562433| |P1Thread1of1ForFork1_#t~ite14_Out2133562433|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite15_Out2133562433| ~y$w_buff0~0_In2133562433)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2133562433, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133562433, ~y$w_buff0~0=~y$w_buff0~0_In2133562433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2133562433, ~weak$$choice2~0=~weak$$choice2~0_In2133562433, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In2133562433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133562433} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2133562433, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2133562433, ~y$w_buff0~0=~y$w_buff0~0_In2133562433, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2133562433, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out2133562433|, ~weak$$choice2~0=~weak$$choice2~0_In2133562433, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2133562433|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133562433} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 20:43:14,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1140359586 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-1140359586| |P1Thread1of1ForFork1_#t~ite17_Out-1140359586|) (= |P1Thread1of1ForFork1_#t~ite18_Out-1140359586| ~y$w_buff1~0_In-1140359586) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out-1140359586| ~y$w_buff1~0_In-1140359586) (= |P1Thread1of1ForFork1_#t~ite18_Out-1140359586| |P1Thread1of1ForFork1_#t~ite17_Out-1140359586|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1140359586 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1140359586 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1140359586 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1140359586 256)))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1140359586, ~y$w_buff1~0=~y$w_buff1~0_In-1140359586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140359586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1140359586, ~weak$$choice2~0=~weak$$choice2~0_In-1140359586, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1140359586|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1140359586} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1140359586, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1140359586|, ~y$w_buff1~0=~y$w_buff1~0_In-1140359586, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1140359586, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1140359586, ~weak$$choice2~0=~weak$$choice2~0_In-1140359586, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1140359586|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1140359586} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 20:43:14,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In452010449 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out452010449| |P1Thread1of1ForFork1_#t~ite20_Out452010449|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In452010449 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In452010449 256))) (= (mod ~y$w_buff0_used~0_In452010449 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In452010449 256) 0) .cse0))) (= ~y$w_buff0_used~0_In452010449 |P1Thread1of1ForFork1_#t~ite20_Out452010449|) .cse1) (and (= ~y$w_buff0_used~0_In452010449 |P1Thread1of1ForFork1_#t~ite21_Out452010449|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite20_In452010449| |P1Thread1of1ForFork1_#t~ite20_Out452010449|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In452010449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452010449, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In452010449|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452010449, ~weak$$choice2~0=~weak$$choice2~0_In452010449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452010449} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In452010449, ~y$w_buff0_used~0=~y$w_buff0_used~0_In452010449, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out452010449|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In452010449, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out452010449|, ~weak$$choice2~0=~weak$$choice2~0_In452010449, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452010449} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 20:43:14,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_61 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} 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 20:43:14,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-886376789 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In-886376789| |P1Thread1of1ForFork1_#t~ite29_Out-886376789|) (= ~y$r_buff1_thd2~0_In-886376789 |P1Thread1of1ForFork1_#t~ite30_Out-886376789|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-886376789 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-886376789 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-886376789 256) 0) (and (= (mod ~y$w_buff1_used~0_In-886376789 256) 0) .cse1))) (= ~y$r_buff1_thd2~0_In-886376789 |P1Thread1of1ForFork1_#t~ite29_Out-886376789|) (= |P1Thread1of1ForFork1_#t~ite30_Out-886376789| |P1Thread1of1ForFork1_#t~ite29_Out-886376789|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-886376789, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-886376789|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-886376789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-886376789, ~weak$$choice2~0=~weak$$choice2~0_In-886376789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-886376789} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-886376789, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-886376789|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-886376789|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-886376789, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-886376789, ~weak$$choice2~0=~weak$$choice2~0_In-886376789, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-886376789} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 20:43:14,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In221846380 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In221846380 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In221846380 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In221846380 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out221846380|)) (and (= ~y$r_buff1_thd1~0_In221846380 |P0Thread1of1ForFork0_#t~ite8_Out221846380|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In221846380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221846380, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In221846380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221846380} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In221846380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In221846380, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out221846380|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In221846380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In221846380} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 20:43:14,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L742-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_7 (+ v_~__unbuffered_cnt~0_8 1)) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, 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_7} 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 20:43:14,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= v_~y~0_15 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} 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_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 20:43:14,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-829372023 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-829372023 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-829372023| ~y~0_In-829372023)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-829372023| ~y$w_buff1~0_In-829372023) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829372023, ~y$w_buff1~0=~y$w_buff1~0_In-829372023, ~y~0=~y~0_In-829372023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829372023} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-829372023, ~y$w_buff1~0=~y$w_buff1~0_In-829372023, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-829372023|, ~y~0=~y~0_In-829372023, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-829372023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 20:43:14,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_16 |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_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 20:43:14,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In480743657 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In480743657 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out480743657|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out480743657| ~y$w_buff0_used~0_In480743657)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In480743657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In480743657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In480743657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In480743657, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out480743657|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 20:43:14,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In1792878762 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1792878762 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1792878762 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1792878762 256)))) (or (and (= ~y$w_buff1_used~0_In1792878762 |P1Thread1of1ForFork1_#t~ite35_Out1792878762|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1792878762|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1792878762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1792878762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1792878762, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1792878762} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1792878762, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1792878762, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1792878762, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1792878762|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1792878762} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 20:43:14,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1159688280 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1159688280 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1159688280|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1159688280 |P1Thread1of1ForFork1_#t~ite36_Out1159688280|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1159688280, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1159688280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1159688280, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1159688280, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1159688280|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 20:43:14,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1432884710 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1432884710 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1432884710 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1432884710 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1432884710| ~y$r_buff1_thd2~0_In1432884710) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite37_Out1432884710| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1432884710, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1432884710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432884710, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1432884710} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1432884710, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1432884710, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1432884710, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1432884710|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1432884710} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 20:43:14,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_45 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_45, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, 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 20:43:14,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~y$w_buff0_used~0_82 256)) (= (mod v_~y$r_buff0_thd0~0_17 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_82, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_17, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 20:43:14,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1394208900 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1394208900 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out1394208900| ~y~0_In1394208900) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1394208900| ~y$w_buff1~0_In1394208900) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1394208900, ~y~0=~y~0_In1394208900, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1394208900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394208900} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1394208900|, ~y$w_buff1~0=~y$w_buff1~0_In1394208900, ~y~0=~y~0_In1394208900, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1394208900, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394208900} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 20:43:14,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_7|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_6|, ~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 20:43:14,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In579337180 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In579337180 256) 0))) (or (and (= ~y$w_buff0_used~0_In579337180 |ULTIMATE.start_main_#t~ite42_Out579337180|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out579337180|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In579337180, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In579337180} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In579337180, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In579337180, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out579337180|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 20:43:14,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In516770347 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In516770347 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In516770347 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In516770347 256)))) (or (and (= ~y$w_buff1_used~0_In516770347 |ULTIMATE.start_main_#t~ite43_Out516770347|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out516770347|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In516770347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In516770347, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In516770347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In516770347} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In516770347, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In516770347, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out516770347|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In516770347, ~y$w_buff1_used~0=~y$w_buff1_used~0_In516770347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 20:43:14,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In375214881 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In375214881 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out375214881|)) (and (= ~y$r_buff0_thd0~0_In375214881 |ULTIMATE.start_main_#t~ite44_Out375214881|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In375214881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375214881} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In375214881, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In375214881, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out375214881|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 20:43:14,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In366094051 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In366094051 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In366094051 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In366094051 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out366094051| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In366094051 |ULTIMATE.start_main_#t~ite45_Out366094051|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In366094051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366094051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In366094051, ~y$w_buff1_used~0=~y$w_buff1_used~0_In366094051} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In366094051, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366094051, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In366094051, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out366094051|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In366094051} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 20:43:14,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_10| v_~y$r_buff1_thd0~0_14) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 2 v_~x~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~x~0=v_~x~0_9, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~x~0=v_~x~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_9|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} 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 20:43:14,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 08:43:14 BasicIcfg [2019-12-18 20:43:14,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 20:43:14,216 INFO L168 Benchmark]: Toolchain (without parser) took 13956.52 ms. Allocated memory was 137.9 MB in the beginning and 458.8 MB in the end (delta: 320.9 MB). Free memory was 100.8 MB in the beginning and 357.3 MB in the end (delta: -256.4 MB). Peak memory consumption was 64.4 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,217 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.33 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,219 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,220 INFO L168 Benchmark]: RCFGBuilder took 790.63 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,220 INFO L168 Benchmark]: TraceAbstraction took 12274.62 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 106.4 MB in the beginning and 357.3 MB in the end (delta: -250.9 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-12-18 20:43:14,224 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.19 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.33 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 155.7 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.79 ms. Allocated memory is still 201.9 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 201.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 790.63 ms. Allocated memory is still 201.9 MB. Free memory was 151.1 MB in the beginning and 107.0 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12274.62 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 106.4 MB in the beginning and 357.3 MB in the end (delta: -250.9 MB). Peak memory consumption was 6.0 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, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 89 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 29 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 27 ChoiceCompositions, 4371 VarBasedMoverChecksPositive, 158 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55625 CheckedPairsTotal, 98 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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 [L799] FCALL, FORK 0 pthread_create(&t596, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L762] 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_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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) [L762] 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) [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 [L763] 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)) [L764] 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)) [L765] 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)) [L766] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=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_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))=0, x=2, 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] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 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 [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, 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] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1710 SDtfs, 1978 SDslu, 3390 SDs, 0 SdLazy, 2663 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9482occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 7578 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 49357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...