/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:19:24,066 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:19:24,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:19:24,079 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:19:24,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:19:24,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:19:24,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:19:24,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:19:24,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:19:24,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:19:24,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:19:24,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:19:24,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:19:24,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:19:24,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:19:24,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:19:24,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:19:24,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:19:24,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:19:24,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:19:24,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:19:24,103 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:19:24,104 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:19:24,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:19:24,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:19:24,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:19:24,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:19:24,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:19:24,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:19:24,113 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:19:24,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:19:24,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:19:24,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:19:24,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:19:24,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:19:24,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:19:24,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:19:24,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:19:24,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:19:24,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:19:24,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:19:24,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:19:24,142 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:19:24,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:19:24,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:19:24,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:19:24,144 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:19:24,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:19:24,145 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:19:24,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:19:24,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:19:24,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:19:24,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:19:24,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:19:24,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:19:24,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:19:24,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:19:24,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:19:24,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:19:24,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:19:24,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:19:24,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:19:24,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:19:24,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:19:24,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:19:24,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:19:24,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:19:24,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:19:24,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:19:24,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:19:24,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:19:24,445 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:19:24,463 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:19:24,466 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:19:24,467 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:19:24,468 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:19:24,469 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 18:19:24,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08562565c/417b4fe50dc942df980878986cb0de60/FLAGdf8571757 [2019-12-18 18:19:25,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:19:25,061 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.opt.i [2019-12-18 18:19:25,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08562565c/417b4fe50dc942df980878986cb0de60/FLAGdf8571757 [2019-12-18 18:19:25,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08562565c/417b4fe50dc942df980878986cb0de60 [2019-12-18 18:19:25,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:19:25,423 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:19:25,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:19:25,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:19:25,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:19:25,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:19:25" (1/1) ... [2019-12-18 18:19:25,431 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 06:19:25, skipping insertion in model container [2019-12-18 18:19:25,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:19:25" (1/1) ... [2019-12-18 18:19:25,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:19:25,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:19:26,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:19:26,076 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:19:26,144 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:19:26,214 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:19:26,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26 WrapperNode [2019-12-18 18:19:26,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:19:26,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:19:26,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:19:26,216 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:19:26,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:19:26,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:19:26,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:19:26,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:19:26,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,313 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (1/1) ... [2019-12-18 18:19:26,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:19:26,318 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:19:26,319 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:19:26,319 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:19:26,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (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 18:19:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:19:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:19:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:19:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:19:26,378 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:19:26,378 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:19:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:19:26,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:19:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:19:26,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:19:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:19:26,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:19:26,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:19:26,381 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 18:19:27,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:19:27,149 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:19:27,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:19:27 BoogieIcfgContainer [2019-12-18 18:19:27,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:19:27,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:19:27,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:19:27,155 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:19:27,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:19:25" (1/3) ... [2019-12-18 18:19:27,156 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6608b234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:19:27, skipping insertion in model container [2019-12-18 18:19:27,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:19:26" (2/3) ... [2019-12-18 18:19:27,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6608b234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:19:27, skipping insertion in model container [2019-12-18 18:19:27,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:19:27" (3/3) ... [2019-12-18 18:19:27,159 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_power.opt.i [2019-12-18 18:19:27,170 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:19:27,170 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:19:27,178 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:19:27,179 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:19:27,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,222 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,223 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,250 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,267 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,274 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,274 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,288 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,289 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,290 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,294 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,295 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:19:27,314 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:19:27,334 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:19:27,334 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:19:27,334 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:19:27,335 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:19:27,335 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:19:27,335 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:19:27,335 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:19:27,335 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:19:27,351 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-18 18:19:27,353 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:19:27,441 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:19:27,441 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:19:27,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:19:27,495 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-18 18:19:27,576 INFO L126 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-18 18:19:27,577 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:19:27,586 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 445 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 18:19:27,608 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-18 18:19:27,609 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:19:33,044 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 18:19:33,172 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 18:19:33,187 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-18 18:19:33,188 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 18:19:33,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-18 18:19:43,314 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-18 18:19:43,315 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-18 18:19:43,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:19:43,321 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:43,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:19:43,323 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-18 18:19:43,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:43,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11857185] [2019-12-18 18:19:43,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:43,572 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 18:19:43,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11857185] [2019-12-18 18:19:43,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:43,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:19:43,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719800625] [2019-12-18 18:19:43,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:19:43,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:43,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:19:43,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:19:43,601 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-18 18:19:44,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:44,674 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-18 18:19:44,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:19:44,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:19:44,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:19:45,162 INFO L225 Difference]: With dead ends: 79498 [2019-12-18 18:19:45,162 INFO L226 Difference]: Without dead ends: 74626 [2019-12-18 18:19:45,164 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 18:19:50,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-18 18:19:52,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-18 18:19:52,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-18 18:19:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-18 18:19:54,905 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-18 18:19:54,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:19:54,906 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-18 18:19:54,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:19:54,906 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-18 18:19:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:19:54,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:54,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:19:54,916 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:54,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:54,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-18 18:19:54,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:54,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060794873] [2019-12-18 18:19:54,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:54,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:19:55,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060794873] [2019-12-18 18:19:55,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:55,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:19:55,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356364269] [2019-12-18 18:19:55,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:19:55,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:55,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:19:55,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:19:55,026 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-18 18:19:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:55,211 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-18 18:19:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:19:55,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:19:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:19:55,283 INFO L225 Difference]: With dead ends: 19918 [2019-12-18 18:19:55,283 INFO L226 Difference]: Without dead ends: 19918 [2019-12-18 18:19:55,284 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 18:19:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-18 18:19:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-18 18:19:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-18 18:19:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-18 18:19:55,729 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-18 18:19:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:19:55,730 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-18 18:19:55,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:19:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-18 18:19:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:19:55,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:55,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:19:55,732 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:55,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-18 18:19:55,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:55,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605458588] [2019-12-18 18:19:55,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:55,875 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 18:19:55,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605458588] [2019-12-18 18:19:55,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:55,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:19:55,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286375343] [2019-12-18 18:19:55,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:19:55,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:55,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:19:55,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:19:55,877 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-18 18:19:56,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:56,290 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-18 18:19:56,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:19:56,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:19:56,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:19:56,373 INFO L225 Difference]: With dead ends: 29603 [2019-12-18 18:19:56,373 INFO L226 Difference]: Without dead ends: 29589 [2019-12-18 18:19:56,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:19:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-18 18:19:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-18 18:19:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-18 18:19:58,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-18 18:19:58,691 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-18 18:19:58,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:19:58,691 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-18 18:19:58,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:19:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-18 18:19:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:19:58,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:19:58,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:19:58,695 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:19:58,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:19:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-18 18:19:58,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:19:58,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892965354] [2019-12-18 18:19:58,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:19:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:19:58,793 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 18:19:58,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892965354] [2019-12-18 18:19:58,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:19:58,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:19:58,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084943294] [2019-12-18 18:19:58,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:19:58,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:19:58,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:19:58,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:19:58,801 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-18 18:19:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:19:59,278 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-18 18:19:59,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:19:59,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 18:19:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:19:59,387 INFO L225 Difference]: With dead ends: 40028 [2019-12-18 18:19:59,388 INFO L226 Difference]: Without dead ends: 40010 [2019-12-18 18:19:59,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:19:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-18 18:20:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-18 18:20:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-18 18:20:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-18 18:20:00,564 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-18 18:20:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:00,565 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-18 18:20:00,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:20:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-18 18:20:00,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:20:00,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:00,576 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:00,576 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:00,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:00,577 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-18 18:20:00,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:00,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822993572] [2019-12-18 18:20:00,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:00,766 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 18:20:00,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822993572] [2019-12-18 18:20:00,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:00,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:20:00,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567494018] [2019-12-18 18:20:00,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:20:00,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:00,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:20:00,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:20:00,769 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-18 18:20:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:01,708 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-18 18:20:01,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:01,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 18:20:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:01,819 INFO L225 Difference]: With dead ends: 54414 [2019-12-18 18:20:01,819 INFO L226 Difference]: Without dead ends: 54384 [2019-12-18 18:20:01,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-18 18:20:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-18 18:20:03,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-18 18:20:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-18 18:20:03,084 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-18 18:20:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:03,085 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-18 18:20:03,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:20:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-18 18:20:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 18:20:03,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:03,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:03,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-18 18:20:03,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:03,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582121124] [2019-12-18 18:20:03,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:03,240 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 18:20:03,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582121124] [2019-12-18 18:20:03,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:03,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:20:03,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650348910] [2019-12-18 18:20:03,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:03,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:03,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:03,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:03,242 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-18 18:20:04,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:04,332 INFO L93 Difference]: Finished difference Result 56211 states and 182423 transitions. [2019-12-18 18:20:04,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 18:20:04,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-18 18:20:04,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:04,478 INFO L225 Difference]: With dead ends: 56211 [2019-12-18 18:20:04,478 INFO L226 Difference]: Without dead ends: 56181 [2019-12-18 18:20:04,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-18 18:20:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56181 states. [2019-12-18 18:20:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56181 to 35539. [2019-12-18 18:20:05,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35539 states. [2019-12-18 18:20:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35539 states to 35539 states and 117693 transitions. [2019-12-18 18:20:05,712 INFO L78 Accepts]: Start accepts. Automaton has 35539 states and 117693 transitions. Word has length 22 [2019-12-18 18:20:05,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:05,714 INFO L462 AbstractCegarLoop]: Abstraction has 35539 states and 117693 transitions. [2019-12-18 18:20:05,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 35539 states and 117693 transitions. [2019-12-18 18:20:05,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:20:05,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:05,727 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:05,728 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:05,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:05,728 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-18 18:20:05,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:05,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633502368] [2019-12-18 18:20:05,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:05,805 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 18:20:05,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633502368] [2019-12-18 18:20:05,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:05,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:05,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965881437] [2019-12-18 18:20:05,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:05,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:05,807 INFO L87 Difference]: Start difference. First operand 35539 states and 117693 transitions. Second operand 4 states. [2019-12-18 18:20:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:05,883 INFO L93 Difference]: Finished difference Result 14114 states and 43412 transitions. [2019-12-18 18:20:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:20:05,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:20:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:05,911 INFO L225 Difference]: With dead ends: 14114 [2019-12-18 18:20:05,912 INFO L226 Difference]: Without dead ends: 14114 [2019-12-18 18:20:05,912 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 18:20:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14114 states. [2019-12-18 18:20:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14114 to 13924. [2019-12-18 18:20:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13924 states. [2019-12-18 18:20:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13924 states to 13924 states and 42859 transitions. [2019-12-18 18:20:06,123 INFO L78 Accepts]: Start accepts. Automaton has 13924 states and 42859 transitions. Word has length 25 [2019-12-18 18:20:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:06,123 INFO L462 AbstractCegarLoop]: Abstraction has 13924 states and 42859 transitions. [2019-12-18 18:20:06,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:06,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13924 states and 42859 transitions. [2019-12-18 18:20:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 18:20:06,142 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:06,143 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:06,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:06,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:06,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-18 18:20:06,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:06,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091406030] [2019-12-18 18:20:06,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:06,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:20:06,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091406030] [2019-12-18 18:20:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:06,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:20:06,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370218591] [2019-12-18 18:20:06,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:06,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:06,203 INFO L87 Difference]: Start difference. First operand 13924 states and 42859 transitions. Second operand 3 states. [2019-12-18 18:20:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:06,262 INFO L93 Difference]: Finished difference Result 13923 states and 42857 transitions. [2019-12-18 18:20:06,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:06,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 18:20:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:06,288 INFO L225 Difference]: With dead ends: 13923 [2019-12-18 18:20:06,288 INFO L226 Difference]: Without dead ends: 13923 [2019-12-18 18:20:06,289 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 18:20:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states. [2019-12-18 18:20:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13923. [2019-12-18 18:20:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13923 states. [2019-12-18 18:20:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13923 states to 13923 states and 42857 transitions. [2019-12-18 18:20:06,512 INFO L78 Accepts]: Start accepts. Automaton has 13923 states and 42857 transitions. Word has length 39 [2019-12-18 18:20:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:06,513 INFO L462 AbstractCegarLoop]: Abstraction has 13923 states and 42857 transitions. [2019-12-18 18:20:06,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:06,513 INFO L276 IsEmpty]: Start isEmpty. Operand 13923 states and 42857 transitions. [2019-12-18 18:20:06,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 18:20:06,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:06,535 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] [2019-12-18 18:20:06,535 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-18 18:20:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419982556] [2019-12-18 18:20:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:06,600 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 18:20:06,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419982556] [2019-12-18 18:20:06,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:06,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:20:06,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037145661] [2019-12-18 18:20:06,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:20:06,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:06,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:20:06,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:06,603 INFO L87 Difference]: Start difference. First operand 13923 states and 42857 transitions. Second operand 5 states. [2019-12-18 18:20:06,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:06,693 INFO L93 Difference]: Finished difference Result 12630 states and 39534 transitions. [2019-12-18 18:20:06,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:20:06,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 18:20:06,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:06,722 INFO L225 Difference]: With dead ends: 12630 [2019-12-18 18:20:06,723 INFO L226 Difference]: Without dead ends: 12630 [2019-12-18 18:20:06,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:20:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12630 states. [2019-12-18 18:20:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12630 to 12176. [2019-12-18 18:20:07,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-18 18:20:07,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 38245 transitions. [2019-12-18 18:20:07,299 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 38245 transitions. Word has length 40 [2019-12-18 18:20:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:07,299 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 38245 transitions. [2019-12-18 18:20:07,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:20:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 38245 transitions. [2019-12-18 18:20:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:07,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:07,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:07,324 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:07,325 INFO L82 PathProgramCache]: Analyzing trace with hash 166042611, now seen corresponding path program 1 times [2019-12-18 18:20:07,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:07,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362391380] [2019-12-18 18:20:07,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:07,421 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 18:20:07,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362391380] [2019-12-18 18:20:07,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:07,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187539956] [2019-12-18 18:20:07,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:07,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:07,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:07,424 INFO L87 Difference]: Start difference. First operand 12176 states and 38245 transitions. Second operand 3 states. [2019-12-18 18:20:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:07,512 INFO L93 Difference]: Finished difference Result 16224 states and 51098 transitions. [2019-12-18 18:20:07,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:07,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:20:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:07,534 INFO L225 Difference]: With dead ends: 16224 [2019-12-18 18:20:07,535 INFO L226 Difference]: Without dead ends: 16224 [2019-12-18 18:20:07,535 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 18:20:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16224 states. [2019-12-18 18:20:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16224 to 13560. [2019-12-18 18:20:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13560 states. [2019-12-18 18:20:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13560 states to 13560 states and 43108 transitions. [2019-12-18 18:20:07,769 INFO L78 Accepts]: Start accepts. Automaton has 13560 states and 43108 transitions. Word has length 54 [2019-12-18 18:20:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:07,769 INFO L462 AbstractCegarLoop]: Abstraction has 13560 states and 43108 transitions. [2019-12-18 18:20:07,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 13560 states and 43108 transitions. [2019-12-18 18:20:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:07,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:07,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:07,790 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:07,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash -2131568022, now seen corresponding path program 1 times [2019-12-18 18:20:07,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:07,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161123551] [2019-12-18 18:20:07,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:07,902 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 18:20:07,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161123551] [2019-12-18 18:20:07,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:07,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:07,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209489148] [2019-12-18 18:20:07,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:07,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:07,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:07,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:07,905 INFO L87 Difference]: Start difference. First operand 13560 states and 43108 transitions. Second operand 4 states. [2019-12-18 18:20:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:08,027 INFO L93 Difference]: Finished difference Result 25313 states and 80847 transitions. [2019-12-18 18:20:08,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:20:08,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 18:20:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:08,055 INFO L225 Difference]: With dead ends: 25313 [2019-12-18 18:20:08,055 INFO L226 Difference]: Without dead ends: 12650 [2019-12-18 18:20:08,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 18:20:08,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12650 states. [2019-12-18 18:20:08,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12650 to 12650. [2019-12-18 18:20:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12650 states. [2019-12-18 18:20:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12650 states to 12650 states and 40344 transitions. [2019-12-18 18:20:08,248 INFO L78 Accepts]: Start accepts. Automaton has 12650 states and 40344 transitions. Word has length 54 [2019-12-18 18:20:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:08,248 INFO L462 AbstractCegarLoop]: Abstraction has 12650 states and 40344 transitions. [2019-12-18 18:20:08,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12650 states and 40344 transitions. [2019-12-18 18:20:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:08,263 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:08,263 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:08,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash 794798576, now seen corresponding path program 2 times [2019-12-18 18:20:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:08,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978029722] [2019-12-18 18:20:08,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:08,337 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 18:20:08,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978029722] [2019-12-18 18:20:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:20:08,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003464149] [2019-12-18 18:20:08,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:20:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:20:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:20:08,339 INFO L87 Difference]: Start difference. First operand 12650 states and 40344 transitions. Second operand 4 states. [2019-12-18 18:20:08,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:08,501 INFO L93 Difference]: Finished difference Result 30768 states and 100350 transitions. [2019-12-18 18:20:08,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:20:08,502 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-18 18:20:08,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:08,513 INFO L225 Difference]: With dead ends: 30768 [2019-12-18 18:20:08,513 INFO L226 Difference]: Without dead ends: 5072 [2019-12-18 18:20:08,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 18:20:08,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2019-12-18 18:20:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2019-12-18 18:20:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2019-12-18 18:20:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 17135 transitions. [2019-12-18 18:20:08,622 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 17135 transitions. Word has length 54 [2019-12-18 18:20:08,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:08,622 INFO L462 AbstractCegarLoop]: Abstraction has 5072 states and 17135 transitions. [2019-12-18 18:20:08,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:20:08,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 17135 transitions. [2019-12-18 18:20:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:08,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:08,630 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:08,631 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:08,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:08,631 INFO L82 PathProgramCache]: Analyzing trace with hash 370181420, now seen corresponding path program 3 times [2019-12-18 18:20:08,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:08,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812497480] [2019-12-18 18:20:08,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:08,717 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 18:20:08,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812497480] [2019-12-18 18:20:08,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:08,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:08,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227402471] [2019-12-18 18:20:08,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:08,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:08,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:08,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:08,719 INFO L87 Difference]: Start difference. First operand 5072 states and 17135 transitions. Second operand 7 states. [2019-12-18 18:20:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:09,005 INFO L93 Difference]: Finished difference Result 9562 states and 31657 transitions. [2019-12-18 18:20:09,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:09,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:09,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:09,020 INFO L225 Difference]: With dead ends: 9562 [2019-12-18 18:20:09,021 INFO L226 Difference]: Without dead ends: 6984 [2019-12-18 18:20:09,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:09,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6984 states. [2019-12-18 18:20:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6984 to 6241. [2019-12-18 18:20:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-12-18 18:20:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 21010 transitions. [2019-12-18 18:20:09,378 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 21010 transitions. Word has length 54 [2019-12-18 18:20:09,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:09,378 INFO L462 AbstractCegarLoop]: Abstraction has 6241 states and 21010 transitions. [2019-12-18 18:20:09,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 21010 transitions. [2019-12-18 18:20:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:09,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:09,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:09,390 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:09,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1876082156, now seen corresponding path program 4 times [2019-12-18 18:20:09,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:09,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494861210] [2019-12-18 18:20:09,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:09,467 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 18:20:09,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494861210] [2019-12-18 18:20:09,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:09,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600974906] [2019-12-18 18:20:09,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:09,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:09,469 INFO L87 Difference]: Start difference. First operand 6241 states and 21010 transitions. Second operand 7 states. [2019-12-18 18:20:09,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:09,723 INFO L93 Difference]: Finished difference Result 11586 states and 38057 transitions. [2019-12-18 18:20:09,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:20:09,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:09,739 INFO L225 Difference]: With dead ends: 11586 [2019-12-18 18:20:09,739 INFO L226 Difference]: Without dead ends: 8529 [2019-12-18 18:20:09,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:09,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8529 states. [2019-12-18 18:20:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8529 to 7599. [2019-12-18 18:20:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7599 states. [2019-12-18 18:20:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7599 states to 7599 states and 25347 transitions. [2019-12-18 18:20:09,873 INFO L78 Accepts]: Start accepts. Automaton has 7599 states and 25347 transitions. Word has length 54 [2019-12-18 18:20:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 7599 states and 25347 transitions. [2019-12-18 18:20:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 7599 states and 25347 transitions. [2019-12-18 18:20:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:09,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:09,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:09,884 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1222512202, now seen corresponding path program 5 times [2019-12-18 18:20:09,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:09,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059532016] [2019-12-18 18:20:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:09,961 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 18:20:09,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059532016] [2019-12-18 18:20:09,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:09,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:20:09,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435719266] [2019-12-18 18:20:09,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:20:09,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:09,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:20:09,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:20:09,964 INFO L87 Difference]: Start difference. First operand 7599 states and 25347 transitions. Second operand 7 states. [2019-12-18 18:20:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:10,277 INFO L93 Difference]: Finished difference Result 16599 states and 53966 transitions. [2019-12-18 18:20:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 18:20:10,278 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-18 18:20:10,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:10,303 INFO L225 Difference]: With dead ends: 16599 [2019-12-18 18:20:10,303 INFO L226 Difference]: Without dead ends: 14168 [2019-12-18 18:20:10,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:20:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14168 states. [2019-12-18 18:20:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14168 to 7739. [2019-12-18 18:20:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2019-12-18 18:20:10,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 25816 transitions. [2019-12-18 18:20:10,484 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 25816 transitions. Word has length 54 [2019-12-18 18:20:10,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:10,484 INFO L462 AbstractCegarLoop]: Abstraction has 7739 states and 25816 transitions. [2019-12-18 18:20:10,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:20:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 25816 transitions. [2019-12-18 18:20:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-18 18:20:10,496 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:10,497 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:10,497 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1952183562, now seen corresponding path program 6 times [2019-12-18 18:20:10,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:10,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084054471] [2019-12-18 18:20:10,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:10,574 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 18:20:10,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084054471] [2019-12-18 18:20:10,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:10,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:10,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452941941] [2019-12-18 18:20:10,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:10,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:10,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:10,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:10,579 INFO L87 Difference]: Start difference. First operand 7739 states and 25816 transitions. Second operand 3 states. [2019-12-18 18:20:10,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:10,638 INFO L93 Difference]: Finished difference Result 6206 states and 20080 transitions. [2019-12-18 18:20:10,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:10,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-18 18:20:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:10,655 INFO L225 Difference]: With dead ends: 6206 [2019-12-18 18:20:10,655 INFO L226 Difference]: Without dead ends: 6206 [2019-12-18 18:20:10,655 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 18:20:10,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6206 states. [2019-12-18 18:20:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6206 to 5926. [2019-12-18 18:20:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 18:20:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19190 transitions. [2019-12-18 18:20:10,796 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19190 transitions. Word has length 54 [2019-12-18 18:20:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:10,797 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19190 transitions. [2019-12-18 18:20:10,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19190 transitions. [2019-12-18 18:20:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-18 18:20:10,806 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:10,806 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:10,806 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:10,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1490833915, now seen corresponding path program 1 times [2019-12-18 18:20:10,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:10,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631134872] [2019-12-18 18:20:10,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:10,909 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 18:20:10,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631134872] [2019-12-18 18:20:10,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:10,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:20:10,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303268203] [2019-12-18 18:20:10,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:20:10,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:10,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:20:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:10,912 INFO L87 Difference]: Start difference. First operand 5926 states and 19190 transitions. Second operand 3 states. [2019-12-18 18:20:10,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:10,953 INFO L93 Difference]: Finished difference Result 5926 states and 19188 transitions. [2019-12-18 18:20:10,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:20:10,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-18 18:20:10,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:10,967 INFO L225 Difference]: With dead ends: 5926 [2019-12-18 18:20:10,967 INFO L226 Difference]: Without dead ends: 5926 [2019-12-18 18:20:10,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:20:11,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5926 states. [2019-12-18 18:20:11,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5926 to 5926. [2019-12-18 18:20:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5926 states. [2019-12-18 18:20:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5926 states to 5926 states and 19188 transitions. [2019-12-18 18:20:11,109 INFO L78 Accepts]: Start accepts. Automaton has 5926 states and 19188 transitions. Word has length 55 [2019-12-18 18:20:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:11,109 INFO L462 AbstractCegarLoop]: Abstraction has 5926 states and 19188 transitions. [2019-12-18 18:20:11,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:20:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5926 states and 19188 transitions. [2019-12-18 18:20:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:11,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:11,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:11,120 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 1 times [2019-12-18 18:20:11,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:11,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608254589] [2019-12-18 18:20:11,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:11,466 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 18:20:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608254589] [2019-12-18 18:20:11,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:11,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:20:11,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583390278] [2019-12-18 18:20:11,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:20:11,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:20:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:11,475 INFO L87 Difference]: Start difference. First operand 5926 states and 19188 transitions. Second operand 11 states. [2019-12-18 18:20:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:12,427 INFO L93 Difference]: Finished difference Result 9280 states and 29862 transitions. [2019-12-18 18:20:12,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 18:20:12,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:20:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:12,442 INFO L225 Difference]: With dead ends: 9280 [2019-12-18 18:20:12,442 INFO L226 Difference]: Without dead ends: 8970 [2019-12-18 18:20:12,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2019-12-18 18:20:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8970 states. [2019-12-18 18:20:12,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8970 to 8294. [2019-12-18 18:20:12,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8294 states. [2019-12-18 18:20:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8294 states to 8294 states and 26956 transitions. [2019-12-18 18:20:12,752 INFO L78 Accepts]: Start accepts. Automaton has 8294 states and 26956 transitions. Word has length 56 [2019-12-18 18:20:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:12,752 INFO L462 AbstractCegarLoop]: Abstraction has 8294 states and 26956 transitions. [2019-12-18 18:20:12,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:20:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8294 states and 26956 transitions. [2019-12-18 18:20:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:12,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:12,762 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:12,763 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1877323349, now seen corresponding path program 2 times [2019-12-18 18:20:12,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:12,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668668979] [2019-12-18 18:20:12,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:13,135 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 18:20:13,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668668979] [2019-12-18 18:20:13,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:13,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 18:20:13,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615479056] [2019-12-18 18:20:13,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 18:20:13,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:13,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 18:20:13,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:20:13,139 INFO L87 Difference]: Start difference. First operand 8294 states and 26956 transitions. Second operand 11 states. [2019-12-18 18:20:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:14,025 INFO L93 Difference]: Finished difference Result 9326 states and 29676 transitions. [2019-12-18 18:20:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:20:14,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-18 18:20:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:14,038 INFO L225 Difference]: With dead ends: 9326 [2019-12-18 18:20:14,039 INFO L226 Difference]: Without dead ends: 6752 [2019-12-18 18:20:14,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:20:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6752 states. [2019-12-18 18:20:14,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6752 to 5982. [2019-12-18 18:20:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5982 states. [2019-12-18 18:20:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5982 states to 5982 states and 19001 transitions. [2019-12-18 18:20:14,180 INFO L78 Accepts]: Start accepts. Automaton has 5982 states and 19001 transitions. Word has length 56 [2019-12-18 18:20:14,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:14,181 INFO L462 AbstractCegarLoop]: Abstraction has 5982 states and 19001 transitions. [2019-12-18 18:20:14,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 18:20:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5982 states and 19001 transitions. [2019-12-18 18:20:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:14,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:14,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:14,191 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash 208159905, now seen corresponding path program 3 times [2019-12-18 18:20:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:14,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268245998] [2019-12-18 18:20:14,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:20:14,527 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 18:20:14,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268245998] [2019-12-18 18:20:14,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:20:14,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 18:20:14,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483880857] [2019-12-18 18:20:14,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 18:20:14,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:20:14,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 18:20:14,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 18:20:14,529 INFO L87 Difference]: Start difference. First operand 5982 states and 19001 transitions. Second operand 12 states. [2019-12-18 18:20:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:20:15,270 INFO L93 Difference]: Finished difference Result 7022 states and 21736 transitions. [2019-12-18 18:20:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 18:20:15,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-18 18:20:15,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:20:15,282 INFO L225 Difference]: With dead ends: 7022 [2019-12-18 18:20:15,282 INFO L226 Difference]: Without dead ends: 6688 [2019-12-18 18:20:15,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-18 18:20:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6688 states. [2019-12-18 18:20:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6688 to 5790. [2019-12-18 18:20:15,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5790 states. [2019-12-18 18:20:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5790 states to 5790 states and 18449 transitions. [2019-12-18 18:20:15,383 INFO L78 Accepts]: Start accepts. Automaton has 5790 states and 18449 transitions. Word has length 56 [2019-12-18 18:20:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:20:15,383 INFO L462 AbstractCegarLoop]: Abstraction has 5790 states and 18449 transitions. [2019-12-18 18:20:15,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 18:20:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5790 states and 18449 transitions. [2019-12-18 18:20:15,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 18:20:15,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:20:15,390 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:20:15,390 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:20:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:20:15,390 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 4 times [2019-12-18 18:20:15,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:20:15,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140039445] [2019-12-18 18:20:15,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:20:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:20:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:20:15,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:20:15,510 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:20:15,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1828~0.base_39|) |v_ULTIMATE.start_main_~#t1828~0.offset_25| 0)) |v_#memory_int_21|) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= 0 |v_ULTIMATE.start_main_~#t1828~0.offset_25|) (= 0 v_~__unbuffered_p0_EAX~0_82) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1828~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1828~0.base_39|) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1828~0.base_39|)) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_16|, ULTIMATE.start_main_~#t1828~0.offset=|v_ULTIMATE.start_main_~#t1828~0.offset_25|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ~x$w_buff1~0=v_~x$w_buff1~0_255, ULTIMATE.start_main_~#t1828~0.base=|v_ULTIMATE.start_main_~#t1828~0.base_39|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~x~0=v_~x~0_186, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_29|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_25|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1830~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1830~0.offset, ULTIMATE.start_main_~#t1828~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t1829~0.base, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1829~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1828~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:20:15,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= |v_#memory_int_15| (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1829~0.base_10|) |v_ULTIMATE.start_main_~#t1829~0.offset_10| 1))) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1829~0.base_10|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1829~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t1829~0.offset_10|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1829~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t1829~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1829~0.offset=|v_ULTIMATE.start_main_~#t1829~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1829~0.base=|v_ULTIMATE.start_main_~#t1829~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1829~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1829~0.base] because there is no mapped edge [2019-12-18 18:20:15,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1830~0.base_10| 4) |v_#length_13|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1830~0.base_10|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1830~0.base_10|) |v_ULTIMATE.start_main_~#t1830~0.offset_9| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1830~0.base_10|)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1830~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1830~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1830~0.offset=|v_ULTIMATE.start_main_~#t1830~0.offset_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1830~0.base=|v_ULTIMATE.start_main_~#t1830~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1830~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1830~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 18:20:15,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~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_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~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_thd3~0, ~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 18:20:15,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In367760140 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In367760140 256)))) (or (and (not .cse0) (= ~x$w_buff1~0_In367760140 |P2Thread1of1ForFork1_#t~ite32_Out367760140|) (not .cse1)) (and (= ~x~0_In367760140 |P2Thread1of1ForFork1_#t~ite32_Out367760140|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In367760140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367760140, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In367760140, ~x~0=~x~0_In367760140} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out367760140|, ~x$w_buff1~0=~x$w_buff1~0_In367760140, ~x$w_buff1_used~0=~x$w_buff1_used~0_In367760140, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In367760140, ~x~0=~x~0_In367760140} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 18:20:15,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In317681431 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In317681431 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out317681431| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out317681431| ~x$w_buff0_used~0_In317681431) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317681431, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317681431} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In317681431, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out317681431|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In317681431} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:20:15,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_22|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_22|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_21|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-18 18:20:15,520 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1741654889 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1741654889 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out1741654889| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1741654889 |P2Thread1of1ForFork1_#t~ite34_Out1741654889|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1741654889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741654889} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1741654889|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1741654889, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1741654889} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 18:20:15,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In453383990 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In453383990 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In453383990 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In453383990 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In453383990 |P1Thread1of1ForFork0_#t~ite29_Out453383990|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out453383990|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In453383990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In453383990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In453383990, ~x$w_buff0_used~0=~x$w_buff0_used~0_In453383990} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In453383990, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In453383990, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In453383990, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out453383990|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In453383990} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:20:15,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2131556985 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2131556985 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_Out-2131556985 ~x$r_buff0_thd2~0_In-2131556985)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-2131556985 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2131556985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131556985} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2131556985|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2131556985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131556985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:20:15,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-865205910 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-865205910 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-865205910 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-865205910 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-865205910|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In-865205910 |P1Thread1of1ForFork0_#t~ite31_Out-865205910|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-865205910, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-865205910, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-865205910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865205910} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-865205910|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-865205910, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-865205910, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-865205910, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-865205910} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:20:15,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_46|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_45|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, 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 18:20:15,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-720930462 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-720930462 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-720930462 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-720930462 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-720930462|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~x$w_buff1_used~0_In-720930462 |P2Thread1of1ForFork1_#t~ite35_Out-720930462|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-720930462, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-720930462, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-720930462, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720930462} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-720930462|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-720930462, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-720930462, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-720930462, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-720930462} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 18:20:15,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1643609346 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1643609346 256)))) (or (and (= ~x$r_buff0_thd3~0_In1643609346 |P2Thread1of1ForFork1_#t~ite36_Out1643609346|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite36_Out1643609346|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1643609346, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1643609346} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1643609346|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1643609346, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1643609346} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 18:20:15,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In858209538 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out858209538| ~x$w_buff1~0_In858209538) (= |P0Thread1of1ForFork2_#t~ite11_In858209538| |P0Thread1of1ForFork2_#t~ite11_Out858209538|)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In858209538 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In858209538 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In858209538 256)) (and (= (mod ~x$w_buff1_used~0_In858209538 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite11_Out858209538| ~x$w_buff1~0_In858209538) (= |P0Thread1of1ForFork2_#t~ite12_Out858209538| |P0Thread1of1ForFork2_#t~ite11_Out858209538|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In858209538, ~x$w_buff1~0=~x$w_buff1~0_In858209538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In858209538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In858209538, ~weak$$choice2~0=~weak$$choice2~0_In858209538, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In858209538|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In858209538} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In858209538, ~x$w_buff1~0=~x$w_buff1~0_In858209538, ~x$w_buff1_used~0=~x$w_buff1_used~0_In858209538, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In858209538, ~weak$$choice2~0=~weak$$choice2~0_In858209538, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out858209538|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out858209538|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In858209538} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 18:20:15,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-886868892 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_In-886868892| |P0Thread1of1ForFork2_#t~ite14_Out-886868892|) (= |P0Thread1of1ForFork2_#t~ite15_Out-886868892| ~x$w_buff0_used~0_In-886868892) (not .cse0)) (and (= |P0Thread1of1ForFork2_#t~ite15_Out-886868892| |P0Thread1of1ForFork2_#t~ite14_Out-886868892|) .cse0 (= ~x$w_buff0_used~0_In-886868892 |P0Thread1of1ForFork2_#t~ite14_Out-886868892|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-886868892 256)))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-886868892 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-886868892 256) 0) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-886868892 256)))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-886868892, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886868892, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-886868892, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-886868892|, ~weak$$choice2~0=~weak$$choice2~0_In-886868892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-886868892} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-886868892, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-886868892, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-886868892|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-886868892, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-886868892|, ~weak$$choice2~0=~weak$$choice2~0_In-886868892, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-886868892} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 18:20:15,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-18 18:20:15,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1056208701 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1056208701| |P0Thread1of1ForFork2_#t~ite24_Out1056208701|) (= ~x$r_buff1_thd1~0_In1056208701 |P0Thread1of1ForFork2_#t~ite23_Out1056208701|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1056208701 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1056208701 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1056208701 256)) .cse0) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In1056208701 256))))) .cse1) (and (not .cse1) (= ~x$r_buff1_thd1~0_In1056208701 |P0Thread1of1ForFork2_#t~ite24_Out1056208701|) (= |P0Thread1of1ForFork2_#t~ite23_In1056208701| |P0Thread1of1ForFork2_#t~ite23_Out1056208701|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056208701, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056208701, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056208701, ~weak$$choice2~0=~weak$$choice2~0_In1056208701, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1056208701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056208701} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056208701, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056208701, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056208701, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1056208701|, ~weak$$choice2~0=~weak$$choice2~0_In1056208701, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1056208701|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056208701} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-18 18:20:15,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-18 18:20:15,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-1595634347 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1595634347 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1595634347 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1595634347 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1595634347| 0)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out-1595634347| ~x$r_buff1_thd3~0_In-1595634347) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1595634347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1595634347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1595634347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1595634347} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1595634347|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1595634347, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1595634347, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1595634347, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1595634347} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 18:20:15,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_32|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_31|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 18:20:15,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_35) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:20:15,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite42_Out-1573431409| |ULTIMATE.start_main_#t~ite41_Out-1573431409|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1573431409 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-1573431409 256)))) (or (and (not .cse0) .cse1 (not .cse2) (= ~x$w_buff1~0_In-1573431409 |ULTIMATE.start_main_#t~ite41_Out-1573431409|)) (and .cse1 (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite41_Out-1573431409| ~x~0_In-1573431409)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1573431409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573431409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1573431409, ~x~0=~x~0_In-1573431409} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-1573431409|, ~x$w_buff1~0=~x$w_buff1~0_In-1573431409, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1573431409, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1573431409, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1573431409|, ~x~0=~x~0_In-1573431409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 18:20:15,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-415201492 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-415201492 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-415201492| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite43_Out-415201492| ~x$w_buff0_used~0_In-415201492) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-415201492, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-415201492} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-415201492, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-415201492|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-415201492} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 18:20:15,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In1249718649 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1249718649 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1249718649 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1249718649 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1249718649| 0)) (and (= ~x$w_buff1_used~0_In1249718649 |ULTIMATE.start_main_#t~ite44_Out1249718649|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1249718649, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1249718649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1249718649, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1249718649} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1249718649, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1249718649, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1249718649, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1249718649|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1249718649} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 18:20:15,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1995170175 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1995170175 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1995170175 |ULTIMATE.start_main_#t~ite45_Out-1995170175|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1995170175|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995170175, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995170175} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1995170175, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1995170175|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1995170175} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 18:20:15,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1751498063 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1751498063 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1751498063 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1751498063 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1751498063|)) (and (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1751498063 |ULTIMATE.start_main_#t~ite46_Out-1751498063|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1751498063, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1751498063, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1751498063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1751498063} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1751498063, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1751498063|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1751498063, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1751498063, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1751498063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 18:20:15,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~main$tmp_guard1~0_24 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:20:15,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:20:15 BasicIcfg [2019-12-18 18:20:15,622 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:20:15,624 INFO L168 Benchmark]: Toolchain (without parser) took 50201.86 ms. Allocated memory was 145.8 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 102.7 MB in the beginning and 793.8 MB in the end (delta: -691.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,625 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,625 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.14 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.34 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,627 INFO L168 Benchmark]: Boogie Preprocessor took 41.28 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,627 INFO L168 Benchmark]: RCFGBuilder took 832.18 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 105.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,628 INFO L168 Benchmark]: TraceAbstraction took 48470.64 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 105.0 MB in the beginning and 793.8 MB in the end (delta: -688.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 18:20:15,631 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.71 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.14 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 102.2 MB in the beginning and 157.1 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.34 ms. Allocated memory is still 203.4 MB. Free memory was 157.1 MB in the beginning and 154.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.28 ms. Allocated memory is still 203.4 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.18 ms. Allocated memory is still 203.4 MB. Free memory was 152.4 MB in the beginning and 105.6 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48470.64 ms. Allocated memory was 203.4 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 105.0 MB in the beginning and 793.8 MB in the end (delta: -688.9 MB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L820] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0: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=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L773] 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) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 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) [L775] 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 [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 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)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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$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)) [L739] 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)) [L740] 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)) [L741] 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=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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 [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L826] 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) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3103 SDtfs, 4226 SDslu, 9913 SDs, 0 SdLazy, 3719 SolverSat, 168 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 19 SyntacticMatches, 11 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred 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: 19.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 64107 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 850 NumberOfCodeBlocks, 850 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 774 ConstructedInterpolants, 0 QuantifiedInterpolants, 194949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...