/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:42:06,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:42:06,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:42:06,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:42:06,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:42:06,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:42:06,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:42:07,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:42:07,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:42:07,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:42:07,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:42:07,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:42:07,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:42:07,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:42:07,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:42:07,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:42:07,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:42:07,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:42:07,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:42:07,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:42:07,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:42:07,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:42:07,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:42:07,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:42:07,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:42:07,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:42:07,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:42:07,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:42:07,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:42:07,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:42:07,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:42:07,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:42:07,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:42:07,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:42:07,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:42:07,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:42:07,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:42:07,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:42:07,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:42:07,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:42:07,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:42:07,055 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-MCR.epf [2019-12-27 22:42:07,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:42:07,083 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:42:07,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:42:07,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:42:07,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:42:07,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:42:07,092 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:42:07,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:42:07,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:42:07,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:42:07,095 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:42:07,096 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:42:07,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:42:07,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:42:07,099 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:42:07,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:42:07,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:42:07,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:42:07,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:42:07,100 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:42:07,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:42:07,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:42:07,102 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:42:07,102 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:42:07,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:42:07,103 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:42:07,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:42:07,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:42:07,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:42:07,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:42:07,396 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:42:07,397 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:42:07,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.oepc.i [2019-12-27 22:42:07,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62b0487/deea877e1cee40a5afdb6385bd7d13f5/FLAG469a5cc7f [2019-12-27 22:42:08,001 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:42:08,002 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.oepc.i [2019-12-27 22:42:08,032 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62b0487/deea877e1cee40a5afdb6385bd7d13f5/FLAG469a5cc7f [2019-12-27 22:42:08,290 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d62b0487/deea877e1cee40a5afdb6385bd7d13f5 [2019-12-27 22:42:08,299 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:42:08,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:42:08,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:42:08,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:42:08,305 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:42:08,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:42:08" (1/1) ... [2019-12-27 22:42:08,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691f4c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:08, skipping insertion in model container [2019-12-27 22:42:08,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:42:08" (1/1) ... [2019-12-27 22:42:08,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:42:08,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:42:08,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:42:08,884 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:42:08,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:42:09,017 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:42:09,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09 WrapperNode [2019-12-27 22:42:09,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:42:09,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:42:09,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:42:09,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:42:09,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,091 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:42:09,092 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:42:09,092 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:42:09,092 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:42:09,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,121 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... [2019-12-27 22:42:09,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:42:09,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:42:09,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:42:09,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:42:09,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:42:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:42:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:42:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:42:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:42:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:42:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:42:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:42:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:42:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:42:09,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:42:09,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:42:09,199 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:42:09,892 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:42:09,892 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:42:09,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:42:09 BoogieIcfgContainer [2019-12-27 22:42:09,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:42:09,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:42:09,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:42:09,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:42:09,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:42:08" (1/3) ... [2019-12-27 22:42:09,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e5dff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:42:09, skipping insertion in model container [2019-12-27 22:42:09,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:42:09" (2/3) ... [2019-12-27 22:42:09,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e5dff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:42:09, skipping insertion in model container [2019-12-27 22:42:09,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:42:09" (3/3) ... [2019-12-27 22:42:09,908 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc.i [2019-12-27 22:42:09,919 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:42:09,920 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:42:09,928 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:42:09,929 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:42:09,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,974 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,975 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,982 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,983 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,986 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:09,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,017 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,020 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,023 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,041 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,044 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:42:10,058 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 22:42:10,078 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:42:10,078 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:42:10,079 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:42:10,079 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:42:10,079 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:42:10,079 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:42:10,079 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:42:10,079 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:42:10,096 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 22:42:10,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 22:42:10,187 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 22:42:10,187 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:42:10,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:42:10,226 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 22:42:10,271 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 22:42:10,271 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:42:10,278 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 22:42:10,292 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 22:42:10,293 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:42:13,720 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 22:42:13,837 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 22:42:13,868 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49856 [2019-12-27 22:42:13,869 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 22:42:13,872 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 22:42:14,286 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8010 states. [2019-12-27 22:42:14,288 INFO L276 IsEmpty]: Start isEmpty. Operand 8010 states. [2019-12-27 22:42:14,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:42:14,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:14,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:42:14,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:14,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 795104, now seen corresponding path program 1 times [2019-12-27 22:42:14,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:14,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340486686] [2019-12-27 22:42:14,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:14,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340486686] [2019-12-27 22:42:14,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:14,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:42:14,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [431177248] [2019-12-27 22:42:14,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:14,556 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:14,569 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:42:14,569 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:14,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:14,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:14,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:14,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:14,589 INFO L87 Difference]: Start difference. First operand 8010 states. Second operand 3 states. [2019-12-27 22:42:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:14,886 INFO L93 Difference]: Finished difference Result 7864 states and 25350 transitions. [2019-12-27 22:42:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:14,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:42:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:15,003 INFO L225 Difference]: With dead ends: 7864 [2019-12-27 22:42:15,003 INFO L226 Difference]: Without dead ends: 7408 [2019-12-27 22:42:15,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7408 states. [2019-12-27 22:42:15,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7408 to 7408. [2019-12-27 22:42:15,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7408 states. [2019-12-27 22:42:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7408 states to 7408 states and 23836 transitions. [2019-12-27 22:42:15,467 INFO L78 Accepts]: Start accepts. Automaton has 7408 states and 23836 transitions. Word has length 3 [2019-12-27 22:42:15,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:15,468 INFO L462 AbstractCegarLoop]: Abstraction has 7408 states and 23836 transitions. [2019-12-27 22:42:15,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:15,468 INFO L276 IsEmpty]: Start isEmpty. Operand 7408 states and 23836 transitions. [2019-12-27 22:42:15,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:42:15,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:15,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:15,475 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:15,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:15,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1603084515, now seen corresponding path program 1 times [2019-12-27 22:42:15,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:15,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698178011] [2019-12-27 22:42:15,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:15,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698178011] [2019-12-27 22:42:15,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:15,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:15,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2051459332] [2019-12-27 22:42:15,598 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:15,599 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:15,601 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:42:15,601 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:15,601 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:15,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:15,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:15,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:15,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:15,603 INFO L87 Difference]: Start difference. First operand 7408 states and 23836 transitions. Second operand 4 states. [2019-12-27 22:42:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:15,658 INFO L93 Difference]: Finished difference Result 1719 states and 4310 transitions. [2019-12-27 22:42:15,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:15,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:42:15,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:15,666 INFO L225 Difference]: With dead ends: 1719 [2019-12-27 22:42:15,667 INFO L226 Difference]: Without dead ends: 1263 [2019-12-27 22:42:15,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-27 22:42:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1263. [2019-12-27 22:42:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1263 states. [2019-12-27 22:42:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 2849 transitions. [2019-12-27 22:42:15,706 INFO L78 Accepts]: Start accepts. Automaton has 1263 states and 2849 transitions. Word has length 11 [2019-12-27 22:42:15,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:15,706 INFO L462 AbstractCegarLoop]: Abstraction has 1263 states and 2849 transitions. [2019-12-27 22:42:15,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1263 states and 2849 transitions. [2019-12-27 22:42:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:42:15,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:15,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:15,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:15,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:15,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1269423525, now seen corresponding path program 1 times [2019-12-27 22:42:15,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:15,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042829412] [2019-12-27 22:42:15,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:15,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:15,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042829412] [2019-12-27 22:42:15,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:15,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:42:15,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1072297716] [2019-12-27 22:42:15,804 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:15,806 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:15,809 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 22:42:15,809 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:15,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:15,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:42:15,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:15,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:42:15,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:15,811 INFO L87 Difference]: Start difference. First operand 1263 states and 2849 transitions. Second operand 5 states. [2019-12-27 22:42:16,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:16,084 INFO L93 Difference]: Finished difference Result 1830 states and 4011 transitions. [2019-12-27 22:42:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:42:16,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 22:42:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:16,095 INFO L225 Difference]: With dead ends: 1830 [2019-12-27 22:42:16,095 INFO L226 Difference]: Without dead ends: 1830 [2019-12-27 22:42:16,096 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-27 22:42:16,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2019-12-27 22:42:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1523. [2019-12-27 22:42:16,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2019-12-27 22:42:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 3383 transitions. [2019-12-27 22:42:16,140 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 3383 transitions. Word has length 14 [2019-12-27 22:42:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:16,141 INFO L462 AbstractCegarLoop]: Abstraction has 1523 states and 3383 transitions. [2019-12-27 22:42:16,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:42:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 3383 transitions. [2019-12-27 22:42:16,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:42:16,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:16,144 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:16,145 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:16,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:16,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1671533958, now seen corresponding path program 1 times [2019-12-27 22:42:16,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:16,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953017332] [2019-12-27 22:42:16,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:16,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953017332] [2019-12-27 22:42:16,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:16,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:16,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [667433005] [2019-12-27 22:42:16,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:16,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:16,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:42:16,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:16,320 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:16,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:16,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:16,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:16,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:16,322 INFO L87 Difference]: Start difference. First operand 1523 states and 3383 transitions. Second operand 6 states. [2019-12-27 22:42:16,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:16,743 INFO L93 Difference]: Finished difference Result 2313 states and 4927 transitions. [2019-12-27 22:42:16,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:42:16,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 22:42:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:16,758 INFO L225 Difference]: With dead ends: 2313 [2019-12-27 22:42:16,759 INFO L226 Difference]: Without dead ends: 2260 [2019-12-27 22:42:16,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:42:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2260 states. [2019-12-27 22:42:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2260 to 1600. [2019-12-27 22:42:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-27 22:42:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3528 transitions. [2019-12-27 22:42:16,909 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3528 transitions. Word has length 25 [2019-12-27 22:42:16,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:16,909 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3528 transitions. [2019-12-27 22:42:16,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:16,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3528 transitions. [2019-12-27 22:42:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 22:42:16,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:16,912 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-27 22:42:16,912 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:16,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash 607421545, now seen corresponding path program 1 times [2019-12-27 22:42:16,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:16,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000762474] [2019-12-27 22:42:16,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000762474] [2019-12-27 22:42:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:42:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2123299379] [2019-12-27 22:42:17,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:17,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:17,040 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 22:42:17,041 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:17,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:17,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:17,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:17,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:17,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:17,043 INFO L87 Difference]: Start difference. First operand 1600 states and 3528 transitions. Second operand 3 states. [2019-12-27 22:42:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:17,055 INFO L93 Difference]: Finished difference Result 1599 states and 3526 transitions. [2019-12-27 22:42:17,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:17,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 22:42:17,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:17,065 INFO L225 Difference]: With dead ends: 1599 [2019-12-27 22:42:17,065 INFO L226 Difference]: Without dead ends: 1599 [2019-12-27 22:42:17,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-12-27 22:42:17,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-12-27 22:42:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-12-27 22:42:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 3526 transitions. [2019-12-27 22:42:17,101 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 3526 transitions. Word has length 26 [2019-12-27 22:42:17,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:17,102 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 3526 transitions. [2019-12-27 22:42:17,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 3526 transitions. [2019-12-27 22:42:17,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:42:17,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:17,105 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-27 22:42:17,105 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:17,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1073597661, now seen corresponding path program 1 times [2019-12-27 22:42:17,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:17,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117090216] [2019-12-27 22:42:17,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:17,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117090216] [2019-12-27 22:42:17,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:17,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:17,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [150491814] [2019-12-27 22:42:17,200 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:17,206 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:17,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 22:42:17,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:17,222 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:42:17,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:42:17,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:17,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:42:17,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:42:17,223 INFO L87 Difference]: Start difference. First operand 1599 states and 3526 transitions. Second operand 4 states. [2019-12-27 22:42:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:17,252 INFO L93 Difference]: Finished difference Result 2557 states and 5706 transitions. [2019-12-27 22:42:17,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:42:17,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 22:42:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:17,259 INFO L225 Difference]: With dead ends: 2557 [2019-12-27 22:42:17,259 INFO L226 Difference]: Without dead ends: 1126 [2019-12-27 22:42:17,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:42:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-12-27 22:42:17,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1126. [2019-12-27 22:42:17,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1126 states. [2019-12-27 22:42:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 2480 transitions. [2019-12-27 22:42:17,284 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 2480 transitions. Word has length 27 [2019-12-27 22:42:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:17,284 INFO L462 AbstractCegarLoop]: Abstraction has 1126 states and 2480 transitions. [2019-12-27 22:42:17,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:42:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 2480 transitions. [2019-12-27 22:42:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 22:42:17,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:17,286 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-27 22:42:17,286 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:17,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:17,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1653898327, now seen corresponding path program 2 times [2019-12-27 22:42:17,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:17,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578709666] [2019-12-27 22:42:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:17,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578709666] [2019-12-27 22:42:17,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:17,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:42:17,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2018775869] [2019-12-27 22:42:17,380 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:17,386 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:17,399 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 22:42:17,399 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:17,531 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 22:42:17,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:42:17,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:17,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:42:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:42:17,532 INFO L87 Difference]: Start difference. First operand 1126 states and 2480 transitions. Second operand 8 states. [2019-12-27 22:42:18,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:18,150 INFO L93 Difference]: Finished difference Result 1824 states and 3932 transitions. [2019-12-27 22:42:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:42:18,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 22:42:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:18,170 INFO L225 Difference]: With dead ends: 1824 [2019-12-27 22:42:18,170 INFO L226 Difference]: Without dead ends: 1824 [2019-12-27 22:42:18,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:42:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2019-12-27 22:42:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1628. [2019-12-27 22:42:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1628 states. [2019-12-27 22:42:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 3557 transitions. [2019-12-27 22:42:18,274 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 3557 transitions. Word has length 27 [2019-12-27 22:42:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:18,274 INFO L462 AbstractCegarLoop]: Abstraction has 1628 states and 3557 transitions. [2019-12-27 22:42:18,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:42:18,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 3557 transitions. [2019-12-27 22:42:18,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:42:18,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:18,277 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-27 22:42:18,277 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:18,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1580443706, now seen corresponding path program 1 times [2019-12-27 22:42:18,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:18,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895392386] [2019-12-27 22:42:18,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:18,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:18,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895392386] [2019-12-27 22:42:18,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:18,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:42:18,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1632317686] [2019-12-27 22:42:18,355 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:18,361 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:18,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 22:42:18,373 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:18,390 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:42:18,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:42:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:42:18,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:42:18,391 INFO L87 Difference]: Start difference. First operand 1628 states and 3557 transitions. Second operand 6 states. [2019-12-27 22:42:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:18,442 INFO L93 Difference]: Finished difference Result 953 states and 1972 transitions. [2019-12-27 22:42:18,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:42:18,442 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 22:42:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:18,445 INFO L225 Difference]: With dead ends: 953 [2019-12-27 22:42:18,446 INFO L226 Difference]: Without dead ends: 822 [2019-12-27 22:42:18,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:42:18,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-27 22:42:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 780. [2019-12-27 22:42:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-27 22:42:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1655 transitions. [2019-12-27 22:42:18,463 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1655 transitions. Word has length 28 [2019-12-27 22:42:18,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:18,463 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1655 transitions. [2019-12-27 22:42:18,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:42:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1655 transitions. [2019-12-27 22:42:18,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 22:42:18,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:18,466 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-27 22:42:18,466 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:18,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:18,467 INFO L82 PathProgramCache]: Analyzing trace with hash -391470674, now seen corresponding path program 1 times [2019-12-27 22:42:18,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:18,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974626060] [2019-12-27 22:42:18,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:18,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974626060] [2019-12-27 22:42:18,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:18,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:18,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856958620] [2019-12-27 22:42:18,560 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:18,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:18,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 111 transitions. [2019-12-27 22:42:18,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:18,678 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:42:18,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:42:18,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:18,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:42:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:42:18,679 INFO L87 Difference]: Start difference. First operand 780 states and 1655 transitions. Second operand 9 states. [2019-12-27 22:42:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:18,936 INFO L93 Difference]: Finished difference Result 1358 states and 2799 transitions. [2019-12-27 22:42:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:42:18,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 22:42:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:18,939 INFO L225 Difference]: With dead ends: 1358 [2019-12-27 22:42:18,939 INFO L226 Difference]: Without dead ends: 910 [2019-12-27 22:42:18,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 22:42:18,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2019-12-27 22:42:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 771. [2019-12-27 22:42:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-27 22:42:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1621 transitions. [2019-12-27 22:42:18,956 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1621 transitions. Word has length 51 [2019-12-27 22:42:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:18,957 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1621 transitions. [2019-12-27 22:42:18,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:42:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1621 transitions. [2019-12-27 22:42:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 22:42:18,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:18,959 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-27 22:42:18,959 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:18,960 INFO L82 PathProgramCache]: Analyzing trace with hash -167213104, now seen corresponding path program 2 times [2019-12-27 22:42:18,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:18,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11995914] [2019-12-27 22:42:18,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:19,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11995914] [2019-12-27 22:42:19,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:19,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:19,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076500215] [2019-12-27 22:42:19,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:19,053 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:19,171 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 22:42:19,171 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:19,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:19,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:19,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:19,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:19,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:19,173 INFO L87 Difference]: Start difference. First operand 771 states and 1621 transitions. Second operand 3 states. [2019-12-27 22:42:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:19,233 INFO L93 Difference]: Finished difference Result 1009 states and 2106 transitions. [2019-12-27 22:42:19,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:19,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 22:42:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:19,236 INFO L225 Difference]: With dead ends: 1009 [2019-12-27 22:42:19,236 INFO L226 Difference]: Without dead ends: 1009 [2019-12-27 22:42:19,236 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-27 22:42:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-12-27 22:42:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 813. [2019-12-27 22:42:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-27 22:42:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1716 transitions. [2019-12-27 22:42:19,253 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1716 transitions. Word has length 51 [2019-12-27 22:42:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:19,254 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1716 transitions. [2019-12-27 22:42:19,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:19,254 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1716 transitions. [2019-12-27 22:42:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:42:19,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:19,257 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-27 22:42:19,257 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:19,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:19,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1521738657, now seen corresponding path program 1 times [2019-12-27 22:42:19,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:19,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419436147] [2019-12-27 22:42:19,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:19,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:42:19,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419436147] [2019-12-27 22:42:19,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:19,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:42:19,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [859438536] [2019-12-27 22:42:19,378 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:19,393 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:19,452 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 131 transitions. [2019-12-27 22:42:19,453 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:19,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:42:19,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:42:19,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:42:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:42:19,518 INFO L87 Difference]: Start difference. First operand 813 states and 1716 transitions. Second operand 8 states. [2019-12-27 22:42:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:20,726 INFO L93 Difference]: Finished difference Result 1414 states and 2937 transitions. [2019-12-27 22:42:20,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 22:42:20,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 22:42:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:20,730 INFO L225 Difference]: With dead ends: 1414 [2019-12-27 22:42:20,730 INFO L226 Difference]: Without dead ends: 1414 [2019-12-27 22:42:20,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:42:20,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2019-12-27 22:42:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 977. [2019-12-27 22:42:20,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-12-27 22:42:20,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 2077 transitions. [2019-12-27 22:42:20,753 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 2077 transitions. Word has length 52 [2019-12-27 22:42:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:20,754 INFO L462 AbstractCegarLoop]: Abstraction has 977 states and 2077 transitions. [2019-12-27 22:42:20,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:42:20,754 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 2077 transitions. [2019-12-27 22:42:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 22:42:20,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:20,757 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-27 22:42:20,757 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1375799289, now seen corresponding path program 2 times [2019-12-27 22:42:20,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:20,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874682337] [2019-12-27 22:42:20,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:42:20,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-27 22:42:20,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874682337] [2019-12-27 22:42:20,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:42:20,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:42:20,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548432825] [2019-12-27 22:42:20,875 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:42:20,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:42:20,954 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 114 transitions. [2019-12-27 22:42:20,954 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:42:20,955 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:42:20,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:42:20,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:42:20,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:42:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,956 INFO L87 Difference]: Start difference. First operand 977 states and 2077 transitions. Second operand 3 states. [2019-12-27 22:42:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:42:20,975 INFO L93 Difference]: Finished difference Result 976 states and 2075 transitions. [2019-12-27 22:42:20,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:42:20,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 22:42:20,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:42:20,979 INFO L225 Difference]: With dead ends: 976 [2019-12-27 22:42:20,980 INFO L226 Difference]: Without dead ends: 976 [2019-12-27 22:42:20,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:42:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-12-27 22:42:20,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 759. [2019-12-27 22:42:20,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 22:42:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1644 transitions. [2019-12-27 22:42:20,999 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1644 transitions. Word has length 52 [2019-12-27 22:42:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:42:20,999 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1644 transitions. [2019-12-27 22:42:21,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:42:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1644 transitions. [2019-12-27 22:42:21,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 22:42:21,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:42:21,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:42:21,003 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:42:21,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:42:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1919945010, now seen corresponding path program 1 times [2019-12-27 22:42:21,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:42:21,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595164688] [2019-12-27 22:42:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:42:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:42:21,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:42:21,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:42:21,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~y$w_buff1~0_23) (= 0 v_~__unbuffered_cnt~0_15) (= |v_#NULL.offset_6| 0) (= 0 v_~y$mem_tmp~0_9) (= 0 v_~y$r_buff1_thd1~0_21) (= |v_ULTIMATE.start_main_~#t2313~0.offset_19| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_24| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_24|) |v_ULTIMATE.start_main_~#t2313~0.offset_19| 0)) |v_#memory_int_17|) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd0~0_25) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_24|) (= v_~y$r_buff0_thd2~0_83 0) (= 0 v_~y$flush_delayed~0_12) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$r_buff0_thd0~0_20 0) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice2~0_33) (= v_~y~0_22 0) (= 0 v_~weak$$choice0~0_7) (= v_~y$w_buff0_used~0_106 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_24| 4)) (= v_~__unbuffered_p1_EBX~0_16 0) (= 0 v_~y$w_buff0~0_25) (= v_~main$tmp_guard1~0_15 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_24| 1)) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_24|) 0) (= 0 v_~y$r_buff1_thd2~0_52) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~main$tmp_guard0~0_11 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_25|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_19|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, #length=|v_#length_17|, ~y~0=v_~y~0_22, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_23, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_24|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_20, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_83, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_19|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_25, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #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, ~__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_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 22:42:21,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-12-27 22:42:21,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out2136305214 ~y$r_buff0_thd2~0_In2136305214) (= ~y$r_buff1_thd1~0_Out2136305214 ~y$r_buff0_thd1~0_In2136305214) (= 1 ~y$r_buff0_thd1~0_Out2136305214) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2136305214)) (= 1 ~x~0_Out2136305214) (= ~y$r_buff0_thd0~0_In2136305214 ~y$r_buff1_thd0~0_Out2136305214)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136305214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2136305214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2136305214, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2136305214} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out2136305214, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out2136305214, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2136305214, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out2136305214, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2136305214, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In2136305214, ~x~0=~x~0_Out2136305214, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out2136305214} 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-27 22:42:21,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2135027270 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In2135027270 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out2135027270| ~y$w_buff0_used~0_In2135027270) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out2135027270| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2135027270, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135027270} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2135027270|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2135027270, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2135027270} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:42:21,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L762-->L762-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2063728160 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2063728160 256)))) (or (and .cse0 (= (mod ~y$w_buff1_used~0_In2063728160 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In2063728160 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2063728160 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite20_Out2063728160| ~y$w_buff0_used~0_In2063728160) (= |P1Thread1of1ForFork1_#t~ite20_Out2063728160| |P1Thread1of1ForFork1_#t~ite21_Out2063728160|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In2063728160| |P1Thread1of1ForFork1_#t~ite20_Out2063728160|) (= |P1Thread1of1ForFork1_#t~ite21_Out2063728160| ~y$w_buff0_used~0_In2063728160) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2063728160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2063728160, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In2063728160|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2063728160, ~weak$$choice2~0=~weak$$choice2~0_In2063728160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063728160} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2063728160, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2063728160, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out2063728160|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2063728160, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out2063728160|, ~weak$$choice2~0=~weak$$choice2~0_In2063728160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2063728160} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 22:42:21,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1886417782 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1886417782| |P1Thread1of1ForFork1_#t~ite24_Out-1886417782|)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1886417782 256))) (.cse4 (= 0 (mod ~y$w_buff1_used~0_In-1886417782 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In-1886417782 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1886417782 256)))) (or (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1886417782| |P1Thread1of1ForFork1_#t~ite23_In-1886417782|) (= ~y$w_buff1_used~0_In-1886417782 |P1Thread1of1ForFork1_#t~ite24_Out-1886417782|) (not .cse0)) (and (or (and .cse1 .cse2) .cse3 (and .cse4 .cse1)) .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-1886417782| ~y$w_buff1_used~0_In-1886417782) .cse0)) (= |P1Thread1of1ForFork1_#t~ite22_In-1886417782| |P1Thread1of1ForFork1_#t~ite22_Out-1886417782|)) (let ((.cse6 (not .cse1))) (and (or (not .cse2) .cse6) .cse5 (= |P1Thread1of1ForFork1_#t~ite22_Out-1886417782| 0) (not .cse3) (or .cse6 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite23_Out-1886417782| |P1Thread1of1ForFork1_#t~ite22_Out-1886417782|) .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1886417782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1886417782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1886417782, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1886417782|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1886417782|, ~weak$$choice2~0=~weak$$choice2~0_In-1886417782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886417782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1886417782, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1886417782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1886417782, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1886417782|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1886417782|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1886417782|, ~weak$$choice2~0=~weak$$choice2~0_In-1886417782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1886417782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 22:42:21,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L764-->L765: Formula: (and (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_8|, ~weak$$choice2~0=v_~weak$$choice2~0_17, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_10|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 22:42:21,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-255912465 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-255912465 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-255912465 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-255912465 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-255912465| 0)) (and (= ~y$w_buff1_used~0_In-255912465 |P0Thread1of1ForFork0_#t~ite6_Out-255912465|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-255912465, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-255912465, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-255912465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-255912465} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-255912465|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-255912465, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-255912465, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-255912465, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-255912465} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:42:21,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-913733204 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-913733204 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out-913733204 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_Out-913733204 ~y$r_buff0_thd1~0_In-913733204)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-913733204, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-913733204} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-913733204, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-913733204|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-913733204} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:42:21,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L765-->L765-8: Formula: (let ((.cse4 (= |P1Thread1of1ForFork1_#t~ite29_Out506992466| |P1Thread1of1ForFork1_#t~ite30_Out506992466|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In506992466 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In506992466 256))) (.cse5 (= (mod ~weak$$choice2~0_In506992466 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In506992466 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In506992466 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite28_In506992466| |P1Thread1of1ForFork1_#t~ite28_Out506992466|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse3 .cse0)) .cse4 (= |P1Thread1of1ForFork1_#t~ite29_Out506992466| ~y$r_buff1_thd2~0_In506992466) .cse5) (and (not .cse5) (= |P1Thread1of1ForFork1_#t~ite29_Out506992466| |P1Thread1of1ForFork1_#t~ite29_In506992466|) (= |P1Thread1of1ForFork1_#t~ite30_Out506992466| ~y$r_buff1_thd2~0_In506992466)))) (let ((.cse6 (not .cse0))) (and (= |P1Thread1of1ForFork1_#t~ite29_Out506992466| |P1Thread1of1ForFork1_#t~ite28_Out506992466|) .cse4 (or .cse6 (not .cse1)) (or .cse6 (not .cse3)) .cse5 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite28_Out506992466| 0))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In506992466, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In506992466|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In506992466, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506992466, ~weak$$choice2~0=~weak$$choice2~0_In506992466, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In506992466|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In506992466} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In506992466, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out506992466|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out506992466|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In506992466, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506992466, ~weak$$choice2~0=~weak$$choice2~0_In506992466, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out506992466|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In506992466} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 22:42:21,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-773559879 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-773559879 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-773559879 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-773559879 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-773559879| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-773559879| ~y$r_buff1_thd1~0_In-773559879)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-773559879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-773559879, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-773559879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773559879} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-773559879, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-773559879, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-773559879|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-773559879, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-773559879} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:42:21,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (= v_~y~0_16 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 22:42:21,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In138960793 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In138960793 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In138960793 |P1Thread1of1ForFork1_#t~ite32_Out138960793|)) (and (= ~y~0_In138960793 |P1Thread1of1ForFork1_#t~ite32_Out138960793|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In138960793, ~y$w_buff1~0=~y$w_buff1~0_In138960793, ~y~0=~y~0_In138960793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138960793} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In138960793, ~y$w_buff1~0=~y$w_buff1~0_In138960793, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out138960793|, ~y~0=~y~0_In138960793, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138960793} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:42:21,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_14 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~y~0=v_~y~0_14} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 22:42:21,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In657537071 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In657537071 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In657537071 |P1Thread1of1ForFork1_#t~ite34_Out657537071|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out657537071|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In657537071, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In657537071} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In657537071, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In657537071, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out657537071|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:42:21,156 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In322403241 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In322403241 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In322403241 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In322403241 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In322403241 |P1Thread1of1ForFork1_#t~ite35_Out322403241|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out322403241|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In322403241, ~y$w_buff0_used~0=~y$w_buff0_used~0_In322403241, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In322403241, ~y$w_buff1_used~0=~y$w_buff1_used~0_In322403241} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In322403241, ~y$w_buff0_used~0=~y$w_buff0_used~0_In322403241, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In322403241, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out322403241|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In322403241} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:42:21,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1989322258 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1989322258 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out1989322258| 0)) (and (= ~y$r_buff0_thd2~0_In1989322258 |P1Thread1of1ForFork1_#t~ite36_Out1989322258|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1989322258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1989322258} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1989322258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1989322258, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1989322258|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:42:21,157 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In2121755829 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In2121755829 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2121755829 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2121755829 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out2121755829| ~y$r_buff1_thd2~0_In2121755829)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out2121755829| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2121755829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121755829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2121755829, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121755829} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2121755829, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2121755829, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2121755829, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out2121755829|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121755829} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:42:21,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_41, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:42:21,158 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_17) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:42:21,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= 0 (mod v_~y$w_buff0_used~0_84 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_84, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:42:21,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1127638819 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In1127638819 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1127638819 |ULTIMATE.start_main_#t~ite40_Out1127638819|)) (and (or .cse1 .cse0) (= ~y~0_In1127638819 |ULTIMATE.start_main_#t~ite40_Out1127638819|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1127638819, ~y~0=~y~0_In1127638819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1127638819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1127638819} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1127638819|, ~y$w_buff1~0=~y$w_buff1~0_In1127638819, ~y~0=~y~0_In1127638819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1127638819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1127638819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 22:42:21,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 22:42:21,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1659449169 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1659449169 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out1659449169| ~y$w_buff0_used~0_In1659449169)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1659449169| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1659449169, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1659449169} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1659449169, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1659449169, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1659449169|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 22:42:21,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1657675646 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1657675646 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1657675646 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1657675646 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1657675646 |ULTIMATE.start_main_#t~ite43_Out-1657675646|)) (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-1657675646|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657675646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1657675646, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1657675646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657675646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1657675646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1657675646, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1657675646|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1657675646, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1657675646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:42:21,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In150672537 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In150672537 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out150672537|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In150672537 |ULTIMATE.start_main_#t~ite44_Out150672537|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In150672537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In150672537} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In150672537, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In150672537, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out150672537|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:42:21,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1174682439 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1174682439 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1174682439 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1174682439 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-1174682439| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-1174682439| ~y$r_buff1_thd0~0_In-1174682439)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174682439, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1174682439, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1174682439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1174682439} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1174682439, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1174682439, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1174682439, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1174682439|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1174682439} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:42:21,162 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~main$tmp_guard1~0_7 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__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, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:42:21,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:42:21 BasicIcfg [2019-12-27 22:42:21,245 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:42:21,247 INFO L168 Benchmark]: Toolchain (without parser) took 12946.39 ms. Allocated memory was 145.2 MB in the beginning and 468.7 MB in the end (delta: 323.5 MB). Free memory was 101.2 MB in the beginning and 100.8 MB in the end (delta: 398.7 kB). Peak memory consumption was 323.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,248 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,249 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.53 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.2 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,250 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,250 INFO L168 Benchmark]: Boogie Preprocessor took 43.82 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,251 INFO L168 Benchmark]: RCFGBuilder took 758.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,252 INFO L168 Benchmark]: TraceAbstraction took 11347.38 ms. Allocated memory was 202.9 MB in the beginning and 468.7 MB in the end (delta: 265.8 MB). Free memory was 107.9 MB in the beginning and 100.8 MB in the end (delta: 7.1 MB). Peak memory consumption was 272.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:42:21,257 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.32 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 716.53 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 157.2 MB in the end (delta: -56.4 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.03 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.82 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 151.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.53 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 107.9 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11347.38 ms. Allocated memory was 202.9 MB in the beginning and 468.7 MB in the end (delta: 265.8 MB). Free memory was 107.9 MB in the beginning and 100.8 MB in the end (delta: 7.1 MB). Peak memory consumption was 272.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 147 ProgramPointsBefore, 74 ProgramPointsAfterwards, 181 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 29 ChoiceCompositions, 4545 VarBasedMoverChecksPositive, 161 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49856 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2313, ((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 [L796] FCALL, FORK 0 pthread_create(&t2314, ((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 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.0s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1400 SDtfs, 1771 SDslu, 2827 SDs, 0 SdLazy, 1901 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8010occurred 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: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 2194 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 355 ConstructedInterpolants, 0 QuantifiedInterpolants, 40179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...