/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 23:05:37,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 23:05:37,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 23:05:38,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 23:05:38,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 23:05:38,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 23:05:38,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 23:05:38,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 23:05:38,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 23:05:38,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 23:05:38,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 23:05:38,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 23:05:38,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 23:05:38,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 23:05:38,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 23:05:38,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 23:05:38,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 23:05:38,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 23:05:38,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 23:05:38,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 23:05:38,064 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 23:05:38,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 23:05:38,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 23:05:38,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 23:05:38,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 23:05:38,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 23:05:38,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 23:05:38,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 23:05:38,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 23:05:38,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 23:05:38,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 23:05:38,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 23:05:38,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 23:05:38,081 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 23:05:38,083 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 23:05:38,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 23:05:38,084 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 23:05:38,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 23:05:38,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 23:05:38,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 23:05:38,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 23:05:38,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 23:05:38,110 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 23:05:38,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 23:05:38,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 23:05:38,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 23:05:38,113 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 23:05:38,114 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 23:05:38,114 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 23:05:38,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 23:05:38,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 23:05:38,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 23:05:38,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 23:05:38,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 23:05:38,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 23:05:38,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 23:05:38,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 23:05:38,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 23:05:38,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 23:05:38,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 23:05:38,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 23:05:38,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 23:05:38,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 23:05:38,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:05:38,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 23:05:38,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 23:05:38,119 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 23:05:38,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 23:05:38,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 23:05:38,119 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 23:05:38,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 23:05:38,120 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 23:05:38,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 23:05:38,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 23:05:38,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 23:05:38,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 23:05:38,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 23:05:38,450 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-18 23:05:38,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffe9f3b4/9a7c332c01be4ee69a4c2bc2a1ecfb36/FLAGed806044d [2019-12-18 23:05:39,071 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 23:05:39,072 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.opt.i [2019-12-18 23:05:39,103 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffe9f3b4/9a7c332c01be4ee69a4c2bc2a1ecfb36/FLAGed806044d [2019-12-18 23:05:39,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffe9f3b4/9a7c332c01be4ee69a4c2bc2a1ecfb36 [2019-12-18 23:05:39,373 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 23:05:39,375 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 23:05:39,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 23:05:39,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 23:05:39,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 23:05:39,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:05:39" (1/1) ... [2019-12-18 23:05:39,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a58602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:39, skipping insertion in model container [2019-12-18 23:05:39,384 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 11:05:39" (1/1) ... [2019-12-18 23:05:39,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 23:05:39,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 23:05:39,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:05:39,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 23:05:40,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 23:05:40,103 INFO L208 MainTranslator]: Completed translation [2019-12-18 23:05:40,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40 WrapperNode [2019-12-18 23:05:40,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 23:05:40,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 23:05:40,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 23:05:40,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 23:05:40,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 23:05:40,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 23:05:40,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 23:05:40,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 23:05:40,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... [2019-12-18 23:05:40,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 23:05:40,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 23:05:40,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 23:05:40,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 23:05:40,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 23:05:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 23:05:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 23:05:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 23:05:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 23:05:40,283 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 23:05:40,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 23:05:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 23:05:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 23:05:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 23:05:40,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 23:05:40,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 23:05:40,286 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 23:05:40,939 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 23:05:40,940 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 23:05:40,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:05:40 BoogieIcfgContainer [2019-12-18 23:05:40,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 23:05:40,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 23:05:40,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 23:05:40,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 23:05:40,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 11:05:39" (1/3) ... [2019-12-18 23:05:40,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1903a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:05:40, skipping insertion in model container [2019-12-18 23:05:40,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 11:05:40" (2/3) ... [2019-12-18 23:05:40,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a1903a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 11:05:40, skipping insertion in model container [2019-12-18 23:05:40,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 11:05:40" (3/3) ... [2019-12-18 23:05:40,954 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-12-18 23:05:40,965 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 23:05:40,966 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 23:05:40,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 23:05:40,979 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 23:05:41,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,038 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,039 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,040 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,048 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,049 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,050 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,051 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,052 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,053 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,054 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,073 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,090 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,091 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,092 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,097 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,098 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,098 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,099 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,100 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,106 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,106 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,107 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,107 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,108 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 23:05:41,155 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 23:05:41,181 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 23:05:41,181 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 23:05:41,181 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 23:05:41,181 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 23:05:41,183 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 23:05:41,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 23:05:41,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 23:05:41,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 23:05:41,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-18 23:05:41,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-18 23:05:41,281 INFO L126 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-18 23:05:41,281 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:05:41,296 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 23:05:41,317 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-18 23:05:41,388 INFO L126 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-18 23:05:41,388 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 23:05:41,396 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 23:05:41,411 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 23:05:41,413 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 23:05:44,361 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-18 23:05:44,476 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-18 23:05:44,557 INFO L206 etLargeBlockEncoding]: Checked pairs total: 42110 [2019-12-18 23:05:44,557 INFO L214 etLargeBlockEncoding]: Total number of compositions: 97 [2019-12-18 23:05:44,561 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 79 transitions [2019-12-18 23:05:44,913 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6782 states. [2019-12-18 23:05:44,915 INFO L276 IsEmpty]: Start isEmpty. Operand 6782 states. [2019-12-18 23:05:44,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 23:05:44,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:44,923 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 23:05:44,923 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash 670284731, now seen corresponding path program 1 times [2019-12-18 23:05:44,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:44,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495204348] [2019-12-18 23:05:44,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:45,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:45,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495204348] [2019-12-18 23:05:45,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:45,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 23:05:45,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882488849] [2019-12-18 23:05:45,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:45,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:45,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:45,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:45,183 INFO L87 Difference]: Start difference. First operand 6782 states. Second operand 3 states. [2019-12-18 23:05:45,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:45,510 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-18 23:05:45,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:45,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 23:05:45,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:45,589 INFO L225 Difference]: With dead ends: 6240 [2019-12-18 23:05:45,589 INFO L226 Difference]: Without dead ends: 5850 [2019-12-18 23:05:45,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-18 23:05:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-18 23:05:45,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-18 23:05:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-18 23:05:45,923 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-18 23:05:45,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:45,923 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-18 23:05:45,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-18 23:05:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 23:05:45,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:45,933 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:45,933 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:45,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:45,935 INFO L82 PathProgramCache]: Analyzing trace with hash 509733655, now seen corresponding path program 1 times [2019-12-18 23:05:45,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:45,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594919728] [2019-12-18 23:05:45,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:46,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594919728] [2019-12-18 23:05:46,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:46,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:46,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129601399] [2019-12-18 23:05:46,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:46,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:46,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:46,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:46,033 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-18 23:05:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:46,076 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-18 23:05:46,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:46,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 23:05:46,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:46,083 INFO L225 Difference]: With dead ends: 1185 [2019-12-18 23:05:46,084 INFO L226 Difference]: Without dead ends: 1185 [2019-12-18 23:05:46,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:46,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-18 23:05:46,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-18 23:05:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-18 23:05:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-18 23:05:46,117 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-18 23:05:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:46,118 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-18 23:05:46,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-18 23:05:46,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:05:46,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:46,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:46,124 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:46,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:46,125 INFO L82 PathProgramCache]: Analyzing trace with hash 310188947, now seen corresponding path program 1 times [2019-12-18 23:05:46,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:46,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882675937] [2019-12-18 23:05:46,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:46,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882675937] [2019-12-18 23:05:46,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:46,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:46,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476742615] [2019-12-18 23:05:46,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:46,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:46,288 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 3 states. [2019-12-18 23:05:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:46,406 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-18 23:05:46,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:46,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 23:05:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:46,420 INFO L225 Difference]: With dead ends: 1756 [2019-12-18 23:05:46,420 INFO L226 Difference]: Without dead ends: 1756 [2019-12-18 23:05:46,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:46,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-18 23:05:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-18 23:05:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-18 23:05:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-18 23:05:46,527 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-18 23:05:46,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:46,527 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-18 23:05:46,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:46,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-18 23:05:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:05:46,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:46,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:46,529 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash 306457384, now seen corresponding path program 1 times [2019-12-18 23:05:46,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:46,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845450894] [2019-12-18 23:05:46,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:46,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845450894] [2019-12-18 23:05:46,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:46,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:46,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493411222] [2019-12-18 23:05:46,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:05:46,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:05:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:46,631 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 4 states. [2019-12-18 23:05:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:46,792 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-18 23:05:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:05:46,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:05:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:46,803 INFO L225 Difference]: With dead ends: 1703 [2019-12-18 23:05:46,804 INFO L226 Difference]: Without dead ends: 1703 [2019-12-18 23:05:46,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-18 23:05:46,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-18 23:05:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-18 23:05:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-18 23:05:46,857 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-18 23:05:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:46,857 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-18 23:05:46,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:05:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-18 23:05:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 23:05:46,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:46,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:46,858 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:46,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1161574652, now seen corresponding path program 1 times [2019-12-18 23:05:46,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:46,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921667540] [2019-12-18 23:05:46,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:46,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:46,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921667540] [2019-12-18 23:05:46,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:46,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:46,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039315876] [2019-12-18 23:05:46,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:05:46,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:46,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:05:46,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:46,999 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 4 states. [2019-12-18 23:05:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:47,216 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-18 23:05:47,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 23:05:47,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 23:05:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:47,230 INFO L225 Difference]: With dead ends: 1972 [2019-12-18 23:05:47,230 INFO L226 Difference]: Without dead ends: 1972 [2019-12-18 23:05:47,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 23:05:47,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-18 23:05:47,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-18 23:05:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-18 23:05:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-18 23:05:47,276 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-18 23:05:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:47,276 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-18 23:05:47,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:05:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-18 23:05:47,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 23:05:47,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:47,280 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 23:05:47,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:47,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:47,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1039744201, now seen corresponding path program 1 times [2019-12-18 23:05:47,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:47,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016920414] [2019-12-18 23:05:47,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:47,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016920414] [2019-12-18 23:05:47,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:47,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:47,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108068101] [2019-12-18 23:05:47,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 23:05:47,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:47,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 23:05:47,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:47,357 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 4 states. [2019-12-18 23:05:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:47,381 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-18 23:05:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 23:05:47,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-18 23:05:47,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:47,386 INFO L225 Difference]: With dead ends: 772 [2019-12-18 23:05:47,386 INFO L226 Difference]: Without dead ends: 772 [2019-12-18 23:05:47,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 23:05:47,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-18 23:05:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-18 23:05:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-18 23:05:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-18 23:05:47,408 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-18 23:05:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:47,408 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-18 23:05:47,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 23:05:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-18 23:05:47,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:47,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:47,411 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] [2019-12-18 23:05:47,411 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:47,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:47,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1200421068, now seen corresponding path program 1 times [2019-12-18 23:05:47,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:47,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804336424] [2019-12-18 23:05:47,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:47,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804336424] [2019-12-18 23:05:47,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:47,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:47,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586987834] [2019-12-18 23:05:47,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:47,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:47,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:47,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:47,556 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 3 states. [2019-12-18 23:05:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:47,574 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-18 23:05:47,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:47,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 23:05:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:47,578 INFO L225 Difference]: With dead ends: 1140 [2019-12-18 23:05:47,579 INFO L226 Difference]: Without dead ends: 438 [2019-12-18 23:05:47,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-18 23:05:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-18 23:05:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-18 23:05:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-18 23:05:47,593 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-18 23:05:47,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:47,594 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-18 23:05:47,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:47,594 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-18 23:05:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:47,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:47,602 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] [2019-12-18 23:05:47,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash -647816914, now seen corresponding path program 2 times [2019-12-18 23:05:47,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:47,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712858938] [2019-12-18 23:05:47,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:47,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:47,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712858938] [2019-12-18 23:05:47,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:47,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 23:05:47,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967897303] [2019-12-18 23:05:47,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:47,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:47,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:47,760 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 6 states. [2019-12-18 23:05:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:47,905 INFO L93 Difference]: Finished difference Result 797 states and 1782 transitions. [2019-12-18 23:05:47,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 23:05:47,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 23:05:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:47,910 INFO L225 Difference]: With dead ends: 797 [2019-12-18 23:05:47,910 INFO L226 Difference]: Without dead ends: 535 [2019-12-18 23:05:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:47,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-12-18 23:05:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 461. [2019-12-18 23:05:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2019-12-18 23:05:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1034 transitions. [2019-12-18 23:05:47,926 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1034 transitions. Word has length 41 [2019-12-18 23:05:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:47,930 INFO L462 AbstractCegarLoop]: Abstraction has 461 states and 1034 transitions. [2019-12-18 23:05:47,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1034 transitions. [2019-12-18 23:05:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:47,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:47,931 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] [2019-12-18 23:05:47,931 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:47,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1820287444, now seen corresponding path program 3 times [2019-12-18 23:05:47,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:47,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347935123] [2019-12-18 23:05:47,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:48,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:48,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347935123] [2019-12-18 23:05:48,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:48,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:05:48,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875996978] [2019-12-18 23:05:48,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 23:05:48,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:48,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 23:05:48,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:05:48,145 INFO L87 Difference]: Start difference. First operand 461 states and 1034 transitions. Second operand 8 states. [2019-12-18 23:05:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:48,611 INFO L93 Difference]: Finished difference Result 705 states and 1447 transitions. [2019-12-18 23:05:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 23:05:48,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-12-18 23:05:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:48,617 INFO L225 Difference]: With dead ends: 705 [2019-12-18 23:05:48,617 INFO L226 Difference]: Without dead ends: 705 [2019-12-18 23:05:48,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-18 23:05:48,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2019-12-18 23:05:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 582. [2019-12-18 23:05:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-12-18 23:05:48,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1226 transitions. [2019-12-18 23:05:48,641 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 1226 transitions. Word has length 41 [2019-12-18 23:05:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:48,642 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 1226 transitions. [2019-12-18 23:05:48,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 23:05:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 1226 transitions. [2019-12-18 23:05:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:48,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:48,644 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] [2019-12-18 23:05:48,644 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:48,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 670576248, now seen corresponding path program 1 times [2019-12-18 23:05:48,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:48,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572567677] [2019-12-18 23:05:48,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:48,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:48,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572567677] [2019-12-18 23:05:48,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:48,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 23:05:48,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186122113] [2019-12-18 23:05:48,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:48,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:48,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:48,721 INFO L87 Difference]: Start difference. First operand 582 states and 1226 transitions. Second operand 3 states. [2019-12-18 23:05:48,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:48,770 INFO L93 Difference]: Finished difference Result 653 states and 1281 transitions. [2019-12-18 23:05:48,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:48,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 23:05:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:48,775 INFO L225 Difference]: With dead ends: 653 [2019-12-18 23:05:48,775 INFO L226 Difference]: Without dead ends: 653 [2019-12-18 23:05:48,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-12-18 23:05:48,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 575. [2019-12-18 23:05:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-18 23:05:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1142 transitions. [2019-12-18 23:05:48,798 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1142 transitions. Word has length 41 [2019-12-18 23:05:48,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:48,798 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1142 transitions. [2019-12-18 23:05:48,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:48,798 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1142 transitions. [2019-12-18 23:05:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:48,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:48,801 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] [2019-12-18 23:05:48,802 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:48,802 INFO L82 PathProgramCache]: Analyzing trace with hash -560460464, now seen corresponding path program 4 times [2019-12-18 23:05:48,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:48,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935366379] [2019-12-18 23:05:48,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:48,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935366379] [2019-12-18 23:05:48,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:48,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 23:05:48,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38153178] [2019-12-18 23:05:48,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 23:05:48,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 23:05:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 23:05:48,970 INFO L87 Difference]: Start difference. First operand 575 states and 1142 transitions. Second operand 9 states. [2019-12-18 23:05:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:49,698 INFO L93 Difference]: Finished difference Result 1278 states and 2500 transitions. [2019-12-18 23:05:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 23:05:49,698 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-18 23:05:49,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:49,706 INFO L225 Difference]: With dead ends: 1278 [2019-12-18 23:05:49,706 INFO L226 Difference]: Without dead ends: 1042 [2019-12-18 23:05:49,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-18 23:05:49,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-12-18 23:05:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 575. [2019-12-18 23:05:49,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-18 23:05:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1135 transitions. [2019-12-18 23:05:49,725 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1135 transitions. Word has length 41 [2019-12-18 23:05:49,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:49,726 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1135 transitions. [2019-12-18 23:05:49,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 23:05:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1135 transitions. [2019-12-18 23:05:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:49,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:49,728 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] [2019-12-18 23:05:49,728 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:49,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:49,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1278508734, now seen corresponding path program 5 times [2019-12-18 23:05:49,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:49,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900488335] [2019-12-18 23:05:49,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:49,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900488335] [2019-12-18 23:05:49,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:49,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 23:05:49,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492542312] [2019-12-18 23:05:49,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 23:05:49,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:49,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 23:05:49,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 23:05:49,817 INFO L87 Difference]: Start difference. First operand 575 states and 1135 transitions. Second operand 6 states. [2019-12-18 23:05:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:50,219 INFO L93 Difference]: Finished difference Result 822 states and 1604 transitions. [2019-12-18 23:05:50,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 23:05:50,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 23:05:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:50,224 INFO L225 Difference]: With dead ends: 822 [2019-12-18 23:05:50,224 INFO L226 Difference]: Without dead ends: 822 [2019-12-18 23:05:50,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 23:05:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2019-12-18 23:05:50,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 599. [2019-12-18 23:05:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-18 23:05:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1188 transitions. [2019-12-18 23:05:50,239 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1188 transitions. Word has length 41 [2019-12-18 23:05:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:50,240 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1188 transitions. [2019-12-18 23:05:50,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 23:05:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1188 transitions. [2019-12-18 23:05:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 23:05:50,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:50,242 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] [2019-12-18 23:05:50,242 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:50,242 INFO L82 PathProgramCache]: Analyzing trace with hash 297826318, now seen corresponding path program 6 times [2019-12-18 23:05:50,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:50,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138586740] [2019-12-18 23:05:50,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 23:05:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 23:05:50,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138586740] [2019-12-18 23:05:50,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 23:05:50,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 23:05:50,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439173180] [2019-12-18 23:05:50,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 23:05:50,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 23:05:50,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 23:05:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:50,304 INFO L87 Difference]: Start difference. First operand 599 states and 1188 transitions. Second operand 3 states. [2019-12-18 23:05:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 23:05:50,316 INFO L93 Difference]: Finished difference Result 599 states and 1186 transitions. [2019-12-18 23:05:50,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 23:05:50,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 23:05:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 23:05:50,319 INFO L225 Difference]: With dead ends: 599 [2019-12-18 23:05:50,319 INFO L226 Difference]: Without dead ends: 599 [2019-12-18 23:05:50,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 23:05:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-18 23:05:50,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 507. [2019-12-18 23:05:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-12-18 23:05:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1013 transitions. [2019-12-18 23:05:50,331 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1013 transitions. Word has length 41 [2019-12-18 23:05:50,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 23:05:50,332 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1013 transitions. [2019-12-18 23:05:50,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 23:05:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1013 transitions. [2019-12-18 23:05:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 23:05:50,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 23:05:50,333 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] [2019-12-18 23:05:50,333 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 23:05:50,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 23:05:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1362148945, now seen corresponding path program 1 times [2019-12-18 23:05:50,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 23:05:50,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461248276] [2019-12-18 23:05:50,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 23:05:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 23:05:50,453 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 23:05:50,453 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 23:05:50,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= 0 v_~x$w_buff0_used~0_94) (= 0 v_~x$w_buff1~0_24) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~weak$$choice0~0_8) (= v_~x$r_buff1_thd2~0_17 0) (= 0 v_~x$r_buff0_thd2~0_24) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_20| 4) |v_#length_15|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_20|) |v_ULTIMATE.start_main_~#t2563~0.offset_16| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff1_thd0~0_22 0) (= 0 v_~x$w_buff0~0_24) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2563~0.base_20|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_20|)) (= v_~y~0_16 0) (= v_~x$r_buff1_thd1~0_39 0) (= v_~x$w_buff1_used~0_56 0) (= 0 v_~x$r_buff0_thd0~0_18) (= v_~x$mem_tmp~0_8 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~x$read_delayed~0_7) (= v_~x$flush_delayed~0_12 0) (= v_~x~0_20 0) (= 0 v_~x$r_buff0_thd1~0_66) (= v_~main$tmp_guard1~0_14 0) (= |v_ULTIMATE.start_main_~#t2563~0.offset_16| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_20| 1) |v_#valid_45|) (= 0 v_~__unbuffered_cnt~0_16) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_24, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_20|, #length=|v_#length_15|, ~y~0=v_~y~0_16, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_18, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~x$w_buff1~0=v_~x$w_buff1~0_24, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_9|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_9|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_16|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_24, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x~0=v_~x~0_20, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 23:05:50,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-12-18 23:05:50,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8)) (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_35)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_35, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 23:05:50,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L733-->L733-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-382651297 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-382651297 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-382651297 256) 0) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-382651297 256))) (= (mod ~x$w_buff0_used~0_In-382651297 256) 0))) (= |P0Thread1of1ForFork1_#t~ite8_Out-382651297| |P0Thread1of1ForFork1_#t~ite9_Out-382651297|) .cse1 (= |P0Thread1of1ForFork1_#t~ite8_Out-382651297| ~x$w_buff0~0_In-382651297)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite8_In-382651297| |P0Thread1of1ForFork1_#t~ite8_Out-382651297|) (= |P0Thread1of1ForFork1_#t~ite9_Out-382651297| ~x$w_buff0~0_In-382651297)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-382651297, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-382651297, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-382651297|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-382651297, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-382651297, ~weak$$choice2~0=~weak$$choice2~0_In-382651297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-382651297} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-382651297, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-382651297, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-382651297|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-382651297|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-382651297, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-382651297, ~weak$$choice2~0=~weak$$choice2~0_In-382651297, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-382651297} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 23:05:50,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_25 256))) (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_50)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_25} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_10|, ~weak$$choice2~0=v_~weak$$choice2~0_25} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-18 23:05:50,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_4 v_~x~0_14) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 23:05:50,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-917245624 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-917245624 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-917245624| ~x$w_buff0_used~0_In-917245624)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-917245624| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-917245624, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-917245624} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-917245624, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-917245624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-917245624} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 23:05:50,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In1492477652 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1492477652 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1492477652 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1492477652 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out1492477652| ~x$w_buff1_used~0_In1492477652) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1492477652|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1492477652, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1492477652, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1492477652, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492477652} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1492477652, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1492477652, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1492477652, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1492477652|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1492477652} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 23:05:50,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In948741479 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In948741479 256)))) (or (and (= ~x$r_buff0_thd2~0_In948741479 ~x$r_buff0_thd2~0_Out948741479) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$r_buff0_thd2~0_Out948741479 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In948741479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In948741479} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out948741479|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out948741479, ~x$w_buff0_used~0=~x$w_buff0_used~0_In948741479} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 23:05:50,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1913514678 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1913514678 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1913514678 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1913514678 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1913514678| 0)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-1913514678| ~x$r_buff1_thd2~0_In-1913514678) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1913514678, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1913514678, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1913514678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1913514678} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1913514678|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1913514678, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1913514678, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1913514678, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1913514678} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 23:05:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_12 |v_P1Thread1of1ForFork0_#t~ite31_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 23:05:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= v_~main$tmp_guard0~0_4 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 23:05:50,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2125196006 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2125196006 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite35_Out-2125196006| |ULTIMATE.start_main_#t~ite34_Out-2125196006|))) (or (and (not .cse0) .cse1 (= ~x$w_buff1~0_In-2125196006 |ULTIMATE.start_main_#t~ite34_Out-2125196006|) (not .cse2)) (and (or .cse0 .cse2) (= ~x~0_In-2125196006 |ULTIMATE.start_main_#t~ite34_Out-2125196006|) .cse1))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2125196006, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125196006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2125196006, ~x~0=~x~0_In-2125196006} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2125196006, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2125196006|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2125196006, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2125196006, ~x~0=~x~0_In-2125196006, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-2125196006|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 23:05:50,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1038585650 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1038585650 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1038585650| ~x$w_buff0_used~0_In-1038585650)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1038585650| 0) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1038585650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1038585650} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1038585650, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1038585650|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1038585650} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 23:05:50,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-564823811 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-564823811 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-564823811 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-564823811 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out-564823811| ~x$w_buff1_used~0_In-564823811) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite37_Out-564823811| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-564823811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-564823811, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-564823811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564823811} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-564823811, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-564823811, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-564823811|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-564823811, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-564823811} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 23:05:50,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-600504623 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-600504623 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out-600504623|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-600504623 |ULTIMATE.start_main_#t~ite38_Out-600504623|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-600504623, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-600504623} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-600504623, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-600504623|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-600504623} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 23:05:50,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-505590660 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-505590660 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-505590660 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-505590660 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-505590660 |ULTIMATE.start_main_#t~ite39_Out-505590660|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-505590660|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-505590660, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-505590660, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-505590660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505590660} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-505590660, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-505590660|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-505590660, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-505590660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-505590660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 23:05:50,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_~__unbuffered_p0_EAX~0_9 0) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite39_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ~y~0=v_~y~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 23:05:50,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 11:05:50 BasicIcfg [2019-12-18 23:05:50,554 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 23:05:50,556 INFO L168 Benchmark]: Toolchain (without parser) took 11181.29 ms. Allocated memory was 140.5 MB in the beginning and 359.7 MB in the end (delta: 219.2 MB). Free memory was 103.3 MB in the beginning and 153.7 MB in the end (delta: -50.4 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,557 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.54 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 103.1 MB in the beginning and 158.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.46 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,559 INFO L168 Benchmark]: Boogie Preprocessor took 35.67 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,560 INFO L168 Benchmark]: RCFGBuilder took 737.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 112.8 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,561 INFO L168 Benchmark]: TraceAbstraction took 9610.86 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 112.2 MB in the beginning and 153.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. [2019-12-18 23:05:50,564 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.48 ms. Allocated memory is still 140.5 MB. Free memory was 123.7 MB in the beginning and 123.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 727.54 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 103.1 MB in the beginning and 158.1 MB in the end (delta: -55.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.46 ms. Allocated memory is still 203.4 MB. Free memory was 158.1 MB in the beginning and 155.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.67 ms. Allocated memory is still 203.4 MB. Free memory was 155.6 MB in the beginning and 153.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 737.64 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 112.8 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9610.86 ms. Allocated memory was 203.4 MB in the beginning and 359.7 MB in the end (delta: 156.2 MB). Free memory was 112.2 MB in the beginning and 153.7 MB in the end (delta: -41.5 MB). Peak memory consumption was 114.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 134 ProgramPointsBefore, 67 ProgramPointsAfterwards, 162 TransitionsBefore, 79 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 19 ChoiceCompositions, 4002 VarBasedMoverChecksPositive, 149 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 42110 CheckedPairsTotal, 97 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1356 SDtfs, 1432 SDslu, 2310 SDs, 0 SdLazy, 1465 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6782occurred 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 2118 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 358 ConstructedInterpolants, 0 QuantifiedInterpolants, 38968 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...