/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:34:13,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:34:13,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:34:13,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:34:13,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:34:13,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:34:13,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:34:13,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:34:13,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:34:13,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:34:13,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:34:13,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:34:13,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:34:13,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:34:13,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:34:13,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:34:13,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:34:13,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:34:13,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:34:13,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:34:13,110 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:34:13,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:34:13,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:34:13,116 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:34:13,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:34:13,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:34:13,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:34:13,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:34:13,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:34:13,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:34:13,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:34:13,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:34:13,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:34:13,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:34:13,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:34:13,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:34:13,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:34:13,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:34:13,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:34:13,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:34:13,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:34:13,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:34:13,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:34:13,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:34:13,160 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:34:13,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:34:13,160 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:34:13,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:34:13,161 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:34:13,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:34:13,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:34:13,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:34:13,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:34:13,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:34:13,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:34:13,167 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:34:13,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:34:13,167 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:34:13,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:34:13,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:34:13,168 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:34:13,168 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:34:13,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:34:13,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:34:13,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:34:13,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:34:13,169 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:34:13,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:34:13,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:34:13,170 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:34:13,170 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:34:13,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:34:13,439 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:34:13,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:34:13,460 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:34:13,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:34:13,463 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:34:13,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2019-12-18 14:34:13,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941312d7f/cc558c09f87043cbbe9158c6e814e832/FLAGdcb1ac87f [2019-12-18 14:34:14,130 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:34:14,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2019-12-18 14:34:14,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941312d7f/cc558c09f87043cbbe9158c6e814e832/FLAGdcb1ac87f [2019-12-18 14:34:14,349 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/941312d7f/cc558c09f87043cbbe9158c6e814e832 [2019-12-18 14:34:14,358 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:34:14,360 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:34:14,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:14,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:34:14,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:34:14,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:14" (1/1) ... [2019-12-18 14:34:14,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32126f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:14, skipping insertion in model container [2019-12-18 14:34:14,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:34:14" (1/1) ... [2019-12-18 14:34:14,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:34:14,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:34:14,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:14,975 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:34:15,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:34:15,149 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:34:15,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15 WrapperNode [2019-12-18 14:34:15,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:34:15,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:15,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:34:15,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:34:15,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,182 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:34:15,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:34:15,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:34:15,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:34:15,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (1/1) ... [2019-12-18 14:34:15,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:34:15,264 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:34:15,264 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:34:15,264 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:34:15,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (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 14:34:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:34:15,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:34:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:34:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:34:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:34:15,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:34:15,334 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:34:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:34:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:34:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:34:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:34:15,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:34:15,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:34:15,337 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 14:34:16,076 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:34:16,076 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:34:16,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:16 BoogieIcfgContainer [2019-12-18 14:34:16,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:34:16,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:34:16,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:34:16,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:34:16,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:34:14" (1/3) ... [2019-12-18 14:34:16,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ce46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:16, skipping insertion in model container [2019-12-18 14:34:16,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:34:15" (2/3) ... [2019-12-18 14:34:16,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b9ce46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:34:16, skipping insertion in model container [2019-12-18 14:34:16,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:34:16" (3/3) ... [2019-12-18 14:34:16,090 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.opt.i [2019-12-18 14:34:16,102 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:34:16,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:34:16,117 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:34:16,118 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:34:16,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,182 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,183 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,186 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,228 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,237 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,238 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,238 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,258 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,259 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,275 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,275 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,276 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:34:16,291 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:34:16,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:34:16,309 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:34:16,309 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:34:16,309 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:34:16,309 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:34:16,309 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:34:16,310 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:34:16,310 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:34:16,327 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 14:34:16,329 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:16,426 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:16,426 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:16,445 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:16,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:34:16,529 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:34:16,529 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:34:16,540 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:34:16,561 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 14:34:16,562 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:34:21,729 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:34:21,855 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:34:21,883 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80053 [2019-12-18 14:34:21,883 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:34:21,887 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 106 transitions [2019-12-18 14:34:39,502 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115670 states. [2019-12-18 14:34:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 115670 states. [2019-12-18 14:34:39,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:34:39,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:39,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:34:39,511 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:39,515 INFO L82 PathProgramCache]: Analyzing trace with hash 846448, now seen corresponding path program 1 times [2019-12-18 14:34:39,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:39,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513890208] [2019-12-18 14:34:39,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:39,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:39,729 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 14:34:39,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513890208] [2019-12-18 14:34:39,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:39,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:34:39,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752856038] [2019-12-18 14:34:39,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:34:39,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:39,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:34:39,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:34:39,764 INFO L87 Difference]: Start difference. First operand 115670 states. Second operand 3 states. [2019-12-18 14:34:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:41,168 INFO L93 Difference]: Finished difference Result 115182 states and 492924 transitions. [2019-12-18 14:34:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:34:41,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:34:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:41,874 INFO L225 Difference]: With dead ends: 115182 [2019-12-18 14:34:41,874 INFO L226 Difference]: Without dead ends: 112830 [2019-12-18 14:34:41,876 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 14:34:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112830 states. [2019-12-18 14:34:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112830 to 112830. [2019-12-18 14:34:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112830 states. [2019-12-18 14:34:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112830 states to 112830 states and 483320 transitions. [2019-12-18 14:34:51,435 INFO L78 Accepts]: Start accepts. Automaton has 112830 states and 483320 transitions. Word has length 3 [2019-12-18 14:34:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:34:51,436 INFO L462 AbstractCegarLoop]: Abstraction has 112830 states and 483320 transitions. [2019-12-18 14:34:51,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:34:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 112830 states and 483320 transitions. [2019-12-18 14:34:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:34:51,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:34:51,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:34:51,441 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:34:51,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:34:51,442 INFO L82 PathProgramCache]: Analyzing trace with hash -939919620, now seen corresponding path program 1 times [2019-12-18 14:34:51,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:34:51,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720625760] [2019-12-18 14:34:51,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:34:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:34:55,155 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 14:34:55,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720625760] [2019-12-18 14:34:55,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:34:55,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:34:55,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596682745] [2019-12-18 14:34:55,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:34:55,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:34:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:34:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:34:55,159 INFO L87 Difference]: Start difference. First operand 112830 states and 483320 transitions. Second operand 4 states. [2019-12-18 14:34:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:34:56,878 INFO L93 Difference]: Finished difference Result 176302 states and 727515 transitions. [2019-12-18 14:34:56,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:34:56,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:34:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:34:57,576 INFO L225 Difference]: With dead ends: 176302 [2019-12-18 14:34:57,576 INFO L226 Difference]: Without dead ends: 176253 [2019-12-18 14:34:57,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:06,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176253 states. [2019-12-18 14:35:10,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176253 to 159436. [2019-12-18 14:35:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159436 states. [2019-12-18 14:35:16,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159436 states to 159436 states and 665691 transitions. [2019-12-18 14:35:16,923 INFO L78 Accepts]: Start accepts. Automaton has 159436 states and 665691 transitions. Word has length 11 [2019-12-18 14:35:16,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:16,924 INFO L462 AbstractCegarLoop]: Abstraction has 159436 states and 665691 transitions. [2019-12-18 14:35:16,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 159436 states and 665691 transitions. [2019-12-18 14:35:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:16,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:16,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:16,932 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash 670018080, now seen corresponding path program 1 times [2019-12-18 14:35:16,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142729751] [2019-12-18 14:35:16,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:17,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:35:17,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142729751] [2019-12-18 14:35:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:17,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642777426] [2019-12-18 14:35:17,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:17,024 INFO L87 Difference]: Start difference. First operand 159436 states and 665691 transitions. Second operand 4 states. [2019-12-18 14:35:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:19,546 INFO L93 Difference]: Finished difference Result 228428 states and 932375 transitions. [2019-12-18 14:35:19,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:19,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:35:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:20,242 INFO L225 Difference]: With dead ends: 228428 [2019-12-18 14:35:20,242 INFO L226 Difference]: Without dead ends: 228365 [2019-12-18 14:35:20,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228365 states. [2019-12-18 14:35:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228365 to 192396. [2019-12-18 14:35:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192396 states. [2019-12-18 14:35:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192396 states to 192396 states and 797806 transitions. [2019-12-18 14:35:36,214 INFO L78 Accepts]: Start accepts. Automaton has 192396 states and 797806 transitions. Word has length 13 [2019-12-18 14:35:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:36,219 INFO L462 AbstractCegarLoop]: Abstraction has 192396 states and 797806 transitions. [2019-12-18 14:35:36,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 192396 states and 797806 transitions. [2019-12-18 14:35:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:35:36,224 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:36,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:36,225 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash -293312110, now seen corresponding path program 1 times [2019-12-18 14:35:36,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:36,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259437177] [2019-12-18 14:35:36,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:36,278 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 14:35:36,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259437177] [2019-12-18 14:35:36,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:36,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:36,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605450096] [2019-12-18 14:35:36,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:36,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:36,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:36,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:36,283 INFO L87 Difference]: Start difference. First operand 192396 states and 797806 transitions. Second operand 3 states. [2019-12-18 14:35:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:37,845 INFO L93 Difference]: Finished difference Result 38255 states and 124332 transitions. [2019-12-18 14:35:37,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:37,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:35:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:37,915 INFO L225 Difference]: With dead ends: 38255 [2019-12-18 14:35:37,916 INFO L226 Difference]: Without dead ends: 38255 [2019-12-18 14:35:37,916 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 14:35:38,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38255 states. [2019-12-18 14:35:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38255 to 38255. [2019-12-18 14:35:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38255 states. [2019-12-18 14:35:38,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38255 states to 38255 states and 124332 transitions. [2019-12-18 14:35:38,558 INFO L78 Accepts]: Start accepts. Automaton has 38255 states and 124332 transitions. Word has length 13 [2019-12-18 14:35:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:38,559 INFO L462 AbstractCegarLoop]: Abstraction has 38255 states and 124332 transitions. [2019-12-18 14:35:38,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:38,559 INFO L276 IsEmpty]: Start isEmpty. Operand 38255 states and 124332 transitions. [2019-12-18 14:35:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:35:38,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:38,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:38,565 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:38,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2105368373, now seen corresponding path program 1 times [2019-12-18 14:35:38,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:38,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219781892] [2019-12-18 14:35:38,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:38,694 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 14:35:38,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219781892] [2019-12-18 14:35:38,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:38,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:38,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987740867] [2019-12-18 14:35:38,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:38,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:38,697 INFO L87 Difference]: Start difference. First operand 38255 states and 124332 transitions. Second operand 5 states. [2019-12-18 14:35:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:39,482 INFO L93 Difference]: Finished difference Result 51712 states and 164813 transitions. [2019-12-18 14:35:39,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:35:39,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:35:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:39,560 INFO L225 Difference]: With dead ends: 51712 [2019-12-18 14:35:39,561 INFO L226 Difference]: Without dead ends: 51699 [2019-12-18 14:35:39,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:35:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51699 states. [2019-12-18 14:35:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51699 to 38713. [2019-12-18 14:35:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38713 states. [2019-12-18 14:35:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38713 states to 38713 states and 125630 transitions. [2019-12-18 14:35:41,554 INFO L78 Accepts]: Start accepts. Automaton has 38713 states and 125630 transitions. Word has length 19 [2019-12-18 14:35:41,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:41,555 INFO L462 AbstractCegarLoop]: Abstraction has 38713 states and 125630 transitions. [2019-12-18 14:35:41,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:41,555 INFO L276 IsEmpty]: Start isEmpty. Operand 38713 states and 125630 transitions. [2019-12-18 14:35:41,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:35:41,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:41,569 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 14:35:41,569 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:41,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:41,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1240477865, now seen corresponding path program 1 times [2019-12-18 14:35:41,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:41,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707510616] [2019-12-18 14:35:41,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:41,632 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 14:35:41,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707510616] [2019-12-18 14:35:41,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:41,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:35:41,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103962847] [2019-12-18 14:35:41,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:35:41,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:41,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:35:41,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:35:41,636 INFO L87 Difference]: Start difference. First operand 38713 states and 125630 transitions. Second operand 4 states. [2019-12-18 14:35:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:41,689 INFO L93 Difference]: Finished difference Result 7422 states and 20312 transitions. [2019-12-18 14:35:41,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:35:41,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:35:41,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:41,703 INFO L225 Difference]: With dead ends: 7422 [2019-12-18 14:35:41,703 INFO L226 Difference]: Without dead ends: 7422 [2019-12-18 14:35:41,704 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 14:35:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7422 states. [2019-12-18 14:35:41,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7422 to 7310. [2019-12-18 14:35:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7310 states. [2019-12-18 14:35:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7310 states to 7310 states and 19992 transitions. [2019-12-18 14:35:41,801 INFO L78 Accepts]: Start accepts. Automaton has 7310 states and 19992 transitions. Word has length 25 [2019-12-18 14:35:41,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:41,802 INFO L462 AbstractCegarLoop]: Abstraction has 7310 states and 19992 transitions. [2019-12-18 14:35:41,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:35:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 7310 states and 19992 transitions. [2019-12-18 14:35:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:35:41,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:41,814 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] [2019-12-18 14:35:41,814 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:41,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:41,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1041968244, now seen corresponding path program 1 times [2019-12-18 14:35:41,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:41,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089085693] [2019-12-18 14:35:41,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:41,917 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 14:35:41,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089085693] [2019-12-18 14:35:41,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:41,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:35:41,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473002986] [2019-12-18 14:35:41,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:41,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:41,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:41,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:41,919 INFO L87 Difference]: Start difference. First operand 7310 states and 19992 transitions. Second operand 5 states. [2019-12-18 14:35:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:41,961 INFO L93 Difference]: Finished difference Result 5312 states and 15267 transitions. [2019-12-18 14:35:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:35:41,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:35:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:41,972 INFO L225 Difference]: With dead ends: 5312 [2019-12-18 14:35:41,972 INFO L226 Difference]: Without dead ends: 5312 [2019-12-18 14:35:41,973 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 14:35:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2019-12-18 14:35:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 4948. [2019-12-18 14:35:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4948 states. [2019-12-18 14:35:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4948 states to 4948 states and 14283 transitions. [2019-12-18 14:35:42,099 INFO L78 Accepts]: Start accepts. Automaton has 4948 states and 14283 transitions. Word has length 37 [2019-12-18 14:35:42,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:42,100 INFO L462 AbstractCegarLoop]: Abstraction has 4948 states and 14283 transitions. [2019-12-18 14:35:42,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4948 states and 14283 transitions. [2019-12-18 14:35:42,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:42,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:42,114 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:42,114 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:42,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:42,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1019045356, now seen corresponding path program 1 times [2019-12-18 14:35:42,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:42,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904886423] [2019-12-18 14:35:42,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:42,285 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 14:35:42,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904886423] [2019-12-18 14:35:42,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:42,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:42,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034032939] [2019-12-18 14:35:42,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:42,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:42,288 INFO L87 Difference]: Start difference. First operand 4948 states and 14283 transitions. Second operand 5 states. [2019-12-18 14:35:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:42,589 INFO L93 Difference]: Finished difference Result 7539 states and 21548 transitions. [2019-12-18 14:35:42,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:35:42,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:35:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:42,598 INFO L225 Difference]: With dead ends: 7539 [2019-12-18 14:35:42,599 INFO L226 Difference]: Without dead ends: 7539 [2019-12-18 14:35:42,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:35:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7539 states. [2019-12-18 14:35:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7539 to 6345. [2019-12-18 14:35:42,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6345 states. [2019-12-18 14:35:42,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6345 states to 6345 states and 18318 transitions. [2019-12-18 14:35:42,686 INFO L78 Accepts]: Start accepts. Automaton has 6345 states and 18318 transitions. Word has length 65 [2019-12-18 14:35:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:42,687 INFO L462 AbstractCegarLoop]: Abstraction has 6345 states and 18318 transitions. [2019-12-18 14:35:42,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6345 states and 18318 transitions. [2019-12-18 14:35:42,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:35:42,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:42,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:42,698 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:42,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:42,699 INFO L82 PathProgramCache]: Analyzing trace with hash -613444874, now seen corresponding path program 2 times [2019-12-18 14:35:42,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:42,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434213782] [2019-12-18 14:35:42,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:42,818 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 14:35:42,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434213782] [2019-12-18 14:35:42,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:42,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:42,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071434776] [2019-12-18 14:35:42,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:42,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:42,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:42,826 INFO L87 Difference]: Start difference. First operand 6345 states and 18318 transitions. Second operand 3 states. [2019-12-18 14:35:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:42,856 INFO L93 Difference]: Finished difference Result 5975 states and 16977 transitions. [2019-12-18 14:35:42,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:42,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:35:42,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:42,865 INFO L225 Difference]: With dead ends: 5975 [2019-12-18 14:35:42,865 INFO L226 Difference]: Without dead ends: 5975 [2019-12-18 14:35:42,865 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 14:35:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2019-12-18 14:35:42,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5819. [2019-12-18 14:35:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5819 states. [2019-12-18 14:35:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5819 states to 5819 states and 16547 transitions. [2019-12-18 14:35:42,944 INFO L78 Accepts]: Start accepts. Automaton has 5819 states and 16547 transitions. Word has length 65 [2019-12-18 14:35:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:42,944 INFO L462 AbstractCegarLoop]: Abstraction has 5819 states and 16547 transitions. [2019-12-18 14:35:42,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5819 states and 16547 transitions. [2019-12-18 14:35:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:42,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:42,952 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:42,953 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 223341978, now seen corresponding path program 1 times [2019-12-18 14:35:42,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:42,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677686891] [2019-12-18 14:35:42,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:43,064 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 14:35:43,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677686891] [2019-12-18 14:35:43,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:43,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:35:43,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059965979] [2019-12-18 14:35:43,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:35:43,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:43,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:35:43,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:35:43,067 INFO L87 Difference]: Start difference. First operand 5819 states and 16547 transitions. Second operand 5 states. [2019-12-18 14:35:43,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:43,417 INFO L93 Difference]: Finished difference Result 8394 states and 23622 transitions. [2019-12-18 14:35:43,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:35:43,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-18 14:35:43,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:43,430 INFO L225 Difference]: With dead ends: 8394 [2019-12-18 14:35:43,431 INFO L226 Difference]: Without dead ends: 8394 [2019-12-18 14:35:43,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:35:43,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8394 states. [2019-12-18 14:35:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8394 to 6167. [2019-12-18 14:35:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6167 states. [2019-12-18 14:35:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6167 states to 6167 states and 17580 transitions. [2019-12-18 14:35:43,565 INFO L78 Accepts]: Start accepts. Automaton has 6167 states and 17580 transitions. Word has length 66 [2019-12-18 14:35:43,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:43,566 INFO L462 AbstractCegarLoop]: Abstraction has 6167 states and 17580 transitions. [2019-12-18 14:35:43,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:35:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 6167 states and 17580 transitions. [2019-12-18 14:35:43,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:35:43,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:43,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:43,578 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:43,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:43,578 INFO L82 PathProgramCache]: Analyzing trace with hash -446701502, now seen corresponding path program 2 times [2019-12-18 14:35:43,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:43,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421694585] [2019-12-18 14:35:43,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:45,270 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 14:35:45,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421694585] [2019-12-18 14:35:45,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:45,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:45,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116160950] [2019-12-18 14:35:45,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:45,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:45,274 INFO L87 Difference]: Start difference. First operand 6167 states and 17580 transitions. Second operand 3 states. [2019-12-18 14:35:45,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:45,332 INFO L93 Difference]: Finished difference Result 6166 states and 17578 transitions. [2019-12-18 14:35:45,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:45,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:35:45,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:45,341 INFO L225 Difference]: With dead ends: 6166 [2019-12-18 14:35:45,341 INFO L226 Difference]: Without dead ends: 6166 [2019-12-18 14:35:45,342 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 14:35:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-12-18 14:35:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 3978. [2019-12-18 14:35:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-18 14:35:45,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 11512 transitions. [2019-12-18 14:35:45,407 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 11512 transitions. Word has length 66 [2019-12-18 14:35:45,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:45,407 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 11512 transitions. [2019-12-18 14:35:45,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 11512 transitions. [2019-12-18 14:35:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:45,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:45,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:45,413 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:45,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1064755320, now seen corresponding path program 1 times [2019-12-18 14:35:45,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:45,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956518749] [2019-12-18 14:35:45,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:45,502 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 14:35:45,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956518749] [2019-12-18 14:35:45,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:45,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:35:45,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115526848] [2019-12-18 14:35:45,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:35:45,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:35:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:35:45,505 INFO L87 Difference]: Start difference. First operand 3978 states and 11512 transitions. Second operand 6 states. [2019-12-18 14:35:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,066 INFO L93 Difference]: Finished difference Result 6598 states and 18721 transitions. [2019-12-18 14:35:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:35:46,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 14:35:46,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,076 INFO L225 Difference]: With dead ends: 6598 [2019-12-18 14:35:46,076 INFO L226 Difference]: Without dead ends: 6598 [2019-12-18 14:35:46,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:35:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2019-12-18 14:35:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 3978. [2019-12-18 14:35:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3978 states. [2019-12-18 14:35:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 11512 transitions. [2019-12-18 14:35:46,145 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 11512 transitions. Word has length 67 [2019-12-18 14:35:46,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,145 INFO L462 AbstractCegarLoop]: Abstraction has 3978 states and 11512 transitions. [2019-12-18 14:35:46,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:35:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 11512 transitions. [2019-12-18 14:35:46,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:46,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,151 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:46,151 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:46,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,152 INFO L82 PathProgramCache]: Analyzing trace with hash -361266720, now seen corresponding path program 2 times [2019-12-18 14:35:46,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152277514] [2019-12-18 14:35:46,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,272 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 14:35:46,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152277514] [2019-12-18 14:35:46,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:35:46,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517034349] [2019-12-18 14:35:46,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:35:46,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:35:46,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:35:46,274 INFO L87 Difference]: Start difference. First operand 3978 states and 11512 transitions. Second operand 6 states. [2019-12-18 14:35:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,349 INFO L93 Difference]: Finished difference Result 6630 states and 19227 transitions. [2019-12-18 14:35:46,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:35:46,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-18 14:35:46,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,355 INFO L225 Difference]: With dead ends: 6630 [2019-12-18 14:35:46,355 INFO L226 Difference]: Without dead ends: 3767 [2019-12-18 14:35:46,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:35:46,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2019-12-18 14:35:46,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3767. [2019-12-18 14:35:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3767 states. [2019-12-18 14:35:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 10857 transitions. [2019-12-18 14:35:46,426 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 10857 transitions. Word has length 67 [2019-12-18 14:35:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,426 INFO L462 AbstractCegarLoop]: Abstraction has 3767 states and 10857 transitions. [2019-12-18 14:35:46,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:35:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 10857 transitions. [2019-12-18 14:35:46,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:35:46,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:46,434 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:46,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1374418208, now seen corresponding path program 3 times [2019-12-18 14:35:46,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074666499] [2019-12-18 14:35:46,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,499 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 14:35:46,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074666499] [2019-12-18 14:35:46,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:35:46,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330586783] [2019-12-18 14:35:46,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:35:46,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:35:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:35:46,501 INFO L87 Difference]: Start difference. First operand 3767 states and 10857 transitions. Second operand 3 states. [2019-12-18 14:35:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:46,524 INFO L93 Difference]: Finished difference Result 3503 states and 9871 transitions. [2019-12-18 14:35:46,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:35:46,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:35:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:46,530 INFO L225 Difference]: With dead ends: 3503 [2019-12-18 14:35:46,530 INFO L226 Difference]: Without dead ends: 3503 [2019-12-18 14:35:46,531 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 14:35:46,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2019-12-18 14:35:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2810. [2019-12-18 14:35:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-18 14:35:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7936 transitions. [2019-12-18 14:35:46,591 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7936 transitions. Word has length 67 [2019-12-18 14:35:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:46,592 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7936 transitions. [2019-12-18 14:35:46,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:35:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7936 transitions. [2019-12-18 14:35:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:46,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:46,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:46,598 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:46,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:46,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1090372922, now seen corresponding path program 1 times [2019-12-18 14:35:46,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:46,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370060814] [2019-12-18 14:35:46,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:46,854 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 14:35:46,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370060814] [2019-12-18 14:35:46,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:46,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:35:46,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407836571] [2019-12-18 14:35:46,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 14:35:46,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:46,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 14:35:46,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:35:46,856 INFO L87 Difference]: Start difference. First operand 2810 states and 7936 transitions. Second operand 12 states. [2019-12-18 14:35:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:47,286 INFO L93 Difference]: Finished difference Result 5384 states and 15163 transitions. [2019-12-18 14:35:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:35:47,287 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 68 [2019-12-18 14:35:47,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:47,295 INFO L225 Difference]: With dead ends: 5384 [2019-12-18 14:35:47,296 INFO L226 Difference]: Without dead ends: 5359 [2019-12-18 14:35:47,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-18 14:35:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2019-12-18 14:35:47,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 3941. [2019-12-18 14:35:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3941 states. [2019-12-18 14:35:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 11030 transitions. [2019-12-18 14:35:47,362 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 11030 transitions. Word has length 68 [2019-12-18 14:35:47,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:47,362 INFO L462 AbstractCegarLoop]: Abstraction has 3941 states and 11030 transitions. [2019-12-18 14:35:47,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 14:35:47,362 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 11030 transitions. [2019-12-18 14:35:47,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:47,367 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:47,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:47,368 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:47,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:47,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1311051616, now seen corresponding path program 2 times [2019-12-18 14:35:47,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:47,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324202440] [2019-12-18 14:35:47,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:47,616 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 14:35:47,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324202440] [2019-12-18 14:35:47,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:47,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:35:47,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641513478] [2019-12-18 14:35:47,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 14:35:47,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 14:35:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:35:47,618 INFO L87 Difference]: Start difference. First operand 3941 states and 11030 transitions. Second operand 13 states. [2019-12-18 14:35:48,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:48,438 INFO L93 Difference]: Finished difference Result 6127 states and 17103 transitions. [2019-12-18 14:35:48,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 14:35:48,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2019-12-18 14:35:48,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:48,448 INFO L225 Difference]: With dead ends: 6127 [2019-12-18 14:35:48,448 INFO L226 Difference]: Without dead ends: 6102 [2019-12-18 14:35:48,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:35:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-12-18 14:35:48,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 4162. [2019-12-18 14:35:48,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4162 states. [2019-12-18 14:35:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4162 states to 4162 states and 11668 transitions. [2019-12-18 14:35:48,508 INFO L78 Accepts]: Start accepts. Automaton has 4162 states and 11668 transitions. Word has length 68 [2019-12-18 14:35:48,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:48,508 INFO L462 AbstractCegarLoop]: Abstraction has 4162 states and 11668 transitions. [2019-12-18 14:35:48,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 14:35:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 4162 states and 11668 transitions. [2019-12-18 14:35:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:48,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:48,513 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:48,513 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:48,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash -526111866, now seen corresponding path program 3 times [2019-12-18 14:35:48,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:48,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878161039] [2019-12-18 14:35:48,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:48,881 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 14:35:48,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878161039] [2019-12-18 14:35:48,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:48,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:35:48,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134897101] [2019-12-18 14:35:48,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:35:48,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:35:48,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:35:48,884 INFO L87 Difference]: Start difference. First operand 4162 states and 11668 transitions. Second operand 15 states. [2019-12-18 14:35:50,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:50,289 INFO L93 Difference]: Finished difference Result 8429 states and 23611 transitions. [2019-12-18 14:35:50,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 14:35:50,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 68 [2019-12-18 14:35:50,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:50,301 INFO L225 Difference]: With dead ends: 8429 [2019-12-18 14:35:50,301 INFO L226 Difference]: Without dead ends: 8404 [2019-12-18 14:35:50,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=355, Invalid=1367, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 14:35:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8404 states. [2019-12-18 14:35:50,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8404 to 4378. [2019-12-18 14:35:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4378 states. [2019-12-18 14:35:50,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4378 states to 4378 states and 12298 transitions. [2019-12-18 14:35:50,377 INFO L78 Accepts]: Start accepts. Automaton has 4378 states and 12298 transitions. Word has length 68 [2019-12-18 14:35:50,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:50,377 INFO L462 AbstractCegarLoop]: Abstraction has 4378 states and 12298 transitions. [2019-12-18 14:35:50,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:35:50,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4378 states and 12298 transitions. [2019-12-18 14:35:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:50,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:50,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:50,384 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1379923308, now seen corresponding path program 4 times [2019-12-18 14:35:50,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:50,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105489935] [2019-12-18 14:35:50,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:50,712 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 14:35:50,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105489935] [2019-12-18 14:35:50,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:50,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:35:50,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252735936] [2019-12-18 14:35:50,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:35:50,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:50,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:35:50,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:35:50,714 INFO L87 Difference]: Start difference. First operand 4378 states and 12298 transitions. Second operand 16 states. [2019-12-18 14:35:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:52,815 INFO L93 Difference]: Finished difference Result 10941 states and 30254 transitions. [2019-12-18 14:35:52,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:35:52,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 14:35:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:52,832 INFO L225 Difference]: With dead ends: 10941 [2019-12-18 14:35:52,832 INFO L226 Difference]: Without dead ends: 10916 [2019-12-18 14:35:52,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=395, Invalid=1957, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:35:52,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10916 states. [2019-12-18 14:35:52,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10916 to 4641. [2019-12-18 14:35:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4641 states. [2019-12-18 14:35:52,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 13069 transitions. [2019-12-18 14:35:52,931 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 13069 transitions. Word has length 68 [2019-12-18 14:35:52,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:52,931 INFO L462 AbstractCegarLoop]: Abstraction has 4641 states and 13069 transitions. [2019-12-18 14:35:52,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:35:52,932 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 13069 transitions. [2019-12-18 14:35:52,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:52,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:52,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:52,936 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:52,936 INFO L82 PathProgramCache]: Analyzing trace with hash 556311610, now seen corresponding path program 5 times [2019-12-18 14:35:52,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:52,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135485193] [2019-12-18 14:35:52,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:53,878 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 14:35:53,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135485193] [2019-12-18 14:35:53,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:53,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-18 14:35:53,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699423715] [2019-12-18 14:35:53,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 14:35:53,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:53,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 14:35:53,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-18 14:35:53,880 INFO L87 Difference]: Start difference. First operand 4641 states and 13069 transitions. Second operand 21 states. [2019-12-18 14:35:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:35:58,819 INFO L93 Difference]: Finished difference Result 11419 states and 32108 transitions. [2019-12-18 14:35:58,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-18 14:35:58,820 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2019-12-18 14:35:58,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:35:58,835 INFO L225 Difference]: With dead ends: 11419 [2019-12-18 14:35:58,835 INFO L226 Difference]: Without dead ends: 11394 [2019-12-18 14:35:58,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1095 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=650, Invalid=3640, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 14:35:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11394 states. [2019-12-18 14:35:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11394 to 5023. [2019-12-18 14:35:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5023 states. [2019-12-18 14:35:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5023 states to 5023 states and 14196 transitions. [2019-12-18 14:35:58,937 INFO L78 Accepts]: Start accepts. Automaton has 5023 states and 14196 transitions. Word has length 68 [2019-12-18 14:35:58,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:35:58,938 INFO L462 AbstractCegarLoop]: Abstraction has 5023 states and 14196 transitions. [2019-12-18 14:35:58,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 14:35:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5023 states and 14196 transitions. [2019-12-18 14:35:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:35:58,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:35:58,943 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:35:58,943 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:35:58,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:35:58,943 INFO L82 PathProgramCache]: Analyzing trace with hash 261877780, now seen corresponding path program 6 times [2019-12-18 14:35:58,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:35:58,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465252411] [2019-12-18 14:35:58,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:35:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:35:59,270 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 14:35:59,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465252411] [2019-12-18 14:35:59,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:35:59,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:35:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794992882] [2019-12-18 14:35:59,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:35:59,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:35:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:35:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:35:59,272 INFO L87 Difference]: Start difference. First operand 5023 states and 14196 transitions. Second operand 16 states. [2019-12-18 14:36:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:01,235 INFO L93 Difference]: Finished difference Result 11000 states and 30490 transitions. [2019-12-18 14:36:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 14:36:01,236 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2019-12-18 14:36:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:01,248 INFO L225 Difference]: With dead ends: 11000 [2019-12-18 14:36:01,248 INFO L226 Difference]: Without dead ends: 10975 [2019-12-18 14:36:01,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=376, Invalid=1880, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:36:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10975 states. [2019-12-18 14:36:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10975 to 4937. [2019-12-18 14:36:01,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4937 states. [2019-12-18 14:36:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 13941 transitions. [2019-12-18 14:36:01,336 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 13941 transitions. Word has length 68 [2019-12-18 14:36:01,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:01,337 INFO L462 AbstractCegarLoop]: Abstraction has 4937 states and 13941 transitions. [2019-12-18 14:36:01,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:36:01,337 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 13941 transitions. [2019-12-18 14:36:01,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:01,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:01,341 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:01,342 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -133778180, now seen corresponding path program 7 times [2019-12-18 14:36:01,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:01,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479337627] [2019-12-18 14:36:01,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:36:01,714 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 14:36:01,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479337627] [2019-12-18 14:36:01,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:36:01,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:36:01,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660788815] [2019-12-18 14:36:01,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:36:01,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:36:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:36:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:36:01,716 INFO L87 Difference]: Start difference. First operand 4937 states and 13941 transitions. Second operand 17 states. [2019-12-18 14:36:04,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:36:04,518 INFO L93 Difference]: Finished difference Result 10509 states and 29423 transitions. [2019-12-18 14:36:04,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 14:36:04,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2019-12-18 14:36:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:36:04,532 INFO L225 Difference]: With dead ends: 10509 [2019-12-18 14:36:04,532 INFO L226 Difference]: Without dead ends: 10484 [2019-12-18 14:36:04,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=558, Invalid=2748, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 14:36:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10484 states. [2019-12-18 14:36:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10484 to 4801. [2019-12-18 14:36:04,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4801 states. [2019-12-18 14:36:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4801 states to 4801 states and 13537 transitions. [2019-12-18 14:36:04,619 INFO L78 Accepts]: Start accepts. Automaton has 4801 states and 13537 transitions. Word has length 68 [2019-12-18 14:36:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:36:04,619 INFO L462 AbstractCegarLoop]: Abstraction has 4801 states and 13537 transitions. [2019-12-18 14:36:04,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:36:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4801 states and 13537 transitions. [2019-12-18 14:36:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:36:04,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:36:04,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:36:04,624 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:36:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:36:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2056032048, now seen corresponding path program 8 times [2019-12-18 14:36:04,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:36:04,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295907592] [2019-12-18 14:36:04,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:36:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:36:04,765 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:36:04,766 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:36:04,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_40) (= v_~z$r_buff1_thd0~0_289 0) (= v_~z$r_buff0_thd1~0_194 0) (= v_~z$mem_tmp~0_22 0) (= v_~z$w_buff0~0_192 0) (= 0 v_~weak$$choice0~0_14) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1970~0.base_23| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1970~0.base_23|) |v_ULTIMATE.start_main_~#t1970~0.offset_17| 0)) |v_#memory_int_23|) (= v_~z~0_201 0) (= 0 v_~__unbuffered_p1_EAX~0_42) (= v_~y~0_14 0) (= v_~main$tmp_guard1~0_48 0) (= |v_#NULL.offset_3| 0) (= v_~z$w_buff0_used~0_745 0) (= v_~z$r_buff0_thd0~0_352 0) (= 0 v_~z$r_buff0_thd3~0_106) (= v_~z$w_buff1_used~0_381 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1970~0.base_23| 4)) (= v_~main$tmp_guard0~0_23 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd1~0_172 0) (= v_~__unbuffered_cnt~0_156 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1970~0.base_23|) (= 0 v_~z$flush_delayed~0_41) (= 0 |v_ULTIMATE.start_main_~#t1970~0.offset_17|) (= v_~z$w_buff1~0_171 0) (= 0 v_~x~0_113) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_111 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1970~0.base_23|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1970~0.base_23| 1) |v_#valid_64|) (= v_~z$r_buff0_thd2~0_100 0) (= v_~z$r_buff1_thd2~0_185 0) (= 0 v_~z$r_buff1_thd3~0_186))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_20|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_26|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_185, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_34|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_27|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_24|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_72|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_72|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_352, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_42, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_40, ~z$mem_tmp~0=v_~z$mem_tmp~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_28|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_39|, ~z$flush_delayed~0=v_~z$flush_delayed~0_41, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_74|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_149|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_172, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_106, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_113, ULTIMATE.start_main_~#t1970~0.base=|v_ULTIMATE.start_main_~#t1970~0.base_23|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_20|, ULTIMATE.start_main_~#t1970~0.offset=|v_ULTIMATE.start_main_~#t1970~0.offset_17|, ULTIMATE.start_main_~#t1971~0.base=|v_ULTIMATE.start_main_~#t1971~0.base_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_32|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_28|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_25|, ~z$w_buff1~0=v_~z$w_buff1~0_171, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_32|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_28|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_260|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_74|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_289, ~y~0=v_~y~0_14, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_100, ULTIMATE.start_main_~#t1972~0.offset=|v_ULTIMATE.start_main_~#t1972~0.offset_16|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_8|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_192, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_186, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_24|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_44|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_41|, ULTIMATE.start_main_~#t1972~0.base=|v_ULTIMATE.start_main_~#t1972~0.base_20|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_149|, ULTIMATE.start_main_~#t1971~0.offset=|v_ULTIMATE.start_main_~#t1971~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_201, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_194} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1970~0.base, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t1970~0.offset, ULTIMATE.start_main_~#t1971~0.base, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1972~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1972~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1971~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:36:04,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L807-1-->L809: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1971~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1971~0.base_11|) |v_ULTIMATE.start_main_~#t1971~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1971~0.offset_10|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1971~0.base_11| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1971~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1971~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1971~0.base_11| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1971~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1971~0.offset=|v_ULTIMATE.start_main_~#t1971~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1971~0.base=|v_ULTIMATE.start_main_~#t1971~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1971~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1971~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:36:04,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_42 v_~z$w_buff1~0_28) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 0 (mod v_~z$w_buff1_used~0_97 256)) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_207 v_~z$w_buff1_used~0_97) (= v_~z$w_buff0_used~0_206 1) (= 2 v_~z$w_buff0~0_41)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_207, ~z$w_buff0~0=v_~z$w_buff0~0_42, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_206, ~z$w_buff0~0=v_~z$w_buff0~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_12, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_97, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, ~z$w_buff1~0=v_~z$w_buff1~0_28, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:36:04,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1972~0.base_12|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1972~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1972~0.base_12|) |v_ULTIMATE.start_main_~#t1972~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1972~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1972~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1972~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1972~0.base_12| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1972~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1972~0.offset=|v_ULTIMATE.start_main_~#t1972~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1972~0.base=|v_ULTIMATE.start_main_~#t1972~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1972~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1972~0.base] because there is no mapped edge [2019-12-18 14:36:04,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In712682951 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In712682951 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out712682951|) (not .cse1)) (and (= ~z$w_buff0_used~0_In712682951 |P0Thread1of1ForFork0_#t~ite5_Out712682951|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In712682951, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In712682951} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out712682951|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In712682951, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In712682951} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:36:04,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In154841878 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In154841878 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In154841878 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In154841878 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out154841878| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out154841878| ~z$w_buff1_used~0_In154841878) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In154841878, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In154841878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In154841878, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In154841878} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out154841878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In154841878, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In154841878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In154841878, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In154841878} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:36:04,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-507977160 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-507977160 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-507977160 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out-507977160 ~z$r_buff0_thd1~0_In-507977160)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-507977160, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-507977160} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-507977160, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-507977160|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-507977160} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:36:04,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In888872376 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In888872376 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In888872376 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In888872376 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out888872376| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite8_Out888872376| ~z$r_buff1_thd1~0_In888872376) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In888872376, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In888872376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888872376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In888872376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In888872376, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out888872376|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In888872376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In888872376, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In888872376} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:36:04,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L748-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_64 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_64, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:36:04,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1837616162 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1837616162 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1837616162| ~z$w_buff1~0_In-1837616162)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite9_Out-1837616162| ~z~0_In-1837616162)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1837616162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837616162, ~z$w_buff1~0=~z$w_buff1~0_In-1837616162, ~z~0=~z~0_In-1837616162} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-1837616162|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1837616162, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1837616162, ~z$w_buff1~0=~z$w_buff1~0_In-1837616162, ~z~0=~z~0_In-1837616162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-18 14:36:04,776 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= v_~z~0_33 |v_P1Thread1of1ForFork1_#t~ite9_16|) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_16|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_15|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_21|, ~z~0=v_~z~0_33} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 14:36:04,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1698663302 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1698663302 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1698663302| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out1698663302| ~z$w_buff0_used~0_In1698663302)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1698663302, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1698663302} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1698663302, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1698663302|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1698663302} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:36:04,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-756917289 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-756917289 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-756917289| ~z~0_In-756917289) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-756917289| ~z$w_buff1~0_In-756917289) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-756917289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-756917289, ~z$w_buff1~0=~z$w_buff1~0_In-756917289, ~z~0=~z~0_In-756917289} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-756917289|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-756917289, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-756917289, ~z$w_buff1~0=~z$w_buff1~0_In-756917289, ~z~0=~z~0_In-756917289} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:36:04,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In259404006 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In259404006 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In259404006 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In259404006 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out259404006|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In259404006 |P1Thread1of1ForFork1_#t~ite12_Out259404006|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In259404006, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In259404006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259404006, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In259404006} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In259404006, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In259404006, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259404006, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out259404006|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In259404006} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:36:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-327847628 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-327847628 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-327847628|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd2~0_In-327847628 |P1Thread1of1ForFork1_#t~ite13_Out-327847628|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-327847628, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-327847628} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-327847628, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-327847628|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-327847628} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:36:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= v_~z~0_45 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_45, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_15|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 14:36:04,779 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In722729901 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In722729901 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out722729901| ~z$w_buff0_used~0_In722729901)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out722729901| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In722729901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In722729901} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In722729901, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In722729901, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out722729901|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:36:04,780 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1696075634 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1696075634 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1696075634 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1696075634 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1696075634|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1696075634 |P2Thread1of1ForFork2_#t~ite18_Out-1696075634|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696075634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696075634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696075634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696075634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1696075634, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1696075634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1696075634, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1696075634, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1696075634|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:36:04,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-175821934 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-175821934 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-175821934| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-175821934| ~z$r_buff0_thd3~0_In-175821934)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-175821934, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-175821934} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-175821934, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-175821934, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-175821934|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:36:04,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd3~0_In-324632752 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-324632752 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-324632752 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-324632752 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-324632752|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-324632752 |P2Thread1of1ForFork2_#t~ite20_Out-324632752|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-324632752, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-324632752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-324632752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324632752} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-324632752, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-324632752|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-324632752, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-324632752, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-324632752} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:36:04,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_34| v_~z$r_buff1_thd3~0_66) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_73 1) v_~__unbuffered_cnt~0_72)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_33|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_66, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:36:04,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-77184021 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-77184021 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-77184021 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-77184021 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-77184021| ~z$r_buff1_thd2~0_In-77184021) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-77184021|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-77184021, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-77184021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77184021, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-77184021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-77184021, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-77184021, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-77184021, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-77184021|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-77184021} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:36:04,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_30| v_~z$r_buff1_thd2~0_54) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:36:04,782 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= 3 v_~__unbuffered_cnt~0_13) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:36:04,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In402033867 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In402033867 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out402033867| ~z~0_In402033867) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite24_Out402033867| ~z$w_buff1~0_In402033867) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In402033867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In402033867, ~z$w_buff1~0=~z$w_buff1~0_In402033867, ~z~0=~z~0_In402033867} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In402033867, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out402033867|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In402033867, ~z$w_buff1~0=~z$w_buff1~0_In402033867, ~z~0=~z~0_In402033867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 14:36:04,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_21 |v_ULTIMATE.start_main_#t~ite24_9|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_9|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_12|, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-18 14:36:04,783 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2084807246 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In2084807246 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out2084807246| ~z$w_buff0_used~0_In2084807246)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out2084807246|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2084807246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2084807246} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2084807246, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2084807246, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2084807246|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:36:04,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-475723235 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-475723235 256))) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-475723235 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-475723235 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-475723235 |ULTIMATE.start_main_#t~ite27_Out-475723235|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite27_Out-475723235| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-475723235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475723235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-475723235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475723235} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-475723235, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-475723235, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-475723235, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-475723235, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-475723235|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:36:04,784 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1796103551 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1796103551 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1796103551| ~z$r_buff0_thd0~0_In1796103551)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1796103551| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796103551, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796103551} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1796103551, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1796103551|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1796103551} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:36:04,785 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1104809676 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1104809676 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1104809676 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1104809676 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out-1104809676| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-1104809676| ~z$r_buff1_thd0~0_In-1104809676) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1104809676, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1104809676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1104809676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1104809676} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1104809676, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1104809676|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1104809676, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1104809676, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1104809676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:36:04,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (= v_~z$r_buff0_thd0~0_167 v_~z$r_buff0_thd0~0_166) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_167, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_166, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:36:04,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L836-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_134) (= 0 v_~z$flush_delayed~0_22) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (not (= (mod v_~z$flush_delayed~0_23 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_23} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_17|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~z$flush_delayed~0=v_~z$flush_delayed~0_22, ~z~0=v_~z~0_134, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:36:04,793 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:36:04,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:36:04 BasicIcfg [2019-12-18 14:36:04,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:36:04,875 INFO L168 Benchmark]: Toolchain (without parser) took 110515.84 ms. Allocated memory was 146.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,875 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.33 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,877 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,878 INFO L168 Benchmark]: RCFGBuilder took 814.91 ms. Allocated memory is still 204.5 MB. Free memory was 152.1 MB in the beginning and 102.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,878 INFO L168 Benchmark]: TraceAbstraction took 108792.78 ms. Allocated memory was 204.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 14:36:04,881 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.24 ms. Allocated memory is still 146.8 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.33 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 157.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.57 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.09 ms. Allocated memory is still 204.5 MB. Free memory was 154.6 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 814.91 ms. Allocated memory is still 204.5 MB. Free memory was 152.1 MB in the beginning and 102.1 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 108792.78 ms. Allocated memory was 204.5 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 101.5 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). 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.5s, 175 ProgramPointsBefore, 95 ProgramPointsAfterwards, 212 TransitionsBefore, 106 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 5490 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 239 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 80053 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1970, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1971, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1972, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __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=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 108.4s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 26.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3281 SDtfs, 4746 SDslu, 14328 SDs, 0 SdLazy, 11037 SolverSat, 473 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 407 GetRequests, 36 SyntacticMatches, 23 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192396occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 107077 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1128 NumberOfCodeBlocks, 1128 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1039 ConstructedInterpolants, 0 QuantifiedInterpolants, 368668 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...