/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:14:23,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:14:23,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:14:23,992 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:14:23,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:14:23,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:14:23,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:14:24,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:14:24,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:14:24,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:14:24,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:14:24,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:14:24,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:14:24,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:14:24,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:14:24,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:14:24,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:14:24,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:14:24,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:14:24,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:14:24,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:14:24,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:14:24,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:14:24,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:14:24,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:14:24,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:14:24,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:14:24,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:14:24,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:14:24,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:14:24,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:14:24,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:14:24,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:14:24,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:14:24,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:14:24,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:14:24,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:14:24,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:14:24,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:14:24,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:14:24,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:14:24,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 06:14:24,050 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:14:24,050 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:14:24,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:14:24,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:14:24,051 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:14:24,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:14:24,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:14:24,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:14:24,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:14:24,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:14:24,053 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:14:24,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:14:24,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:14:24,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:14:24,054 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:14:24,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:14:24,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:14:24,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:14:24,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:14:24,057 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:14:24,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:14:24,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:14:24,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:14:24,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:14:24,371 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:14:24,372 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2019-12-27 06:14:24,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9274501e/04f229835e984a9f822fc7f383b972aa/FLAGc113a0928 [2019-12-27 06:14:25,061 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:14:25,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_pso.oepc.i [2019-12-27 06:14:25,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9274501e/04f229835e984a9f822fc7f383b972aa/FLAGc113a0928 [2019-12-27 06:14:25,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9274501e/04f229835e984a9f822fc7f383b972aa [2019-12-27 06:14:25,335 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:14:25,336 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:14:25,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:14:25,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:14:25,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:14:25,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:25" (1/1) ... [2019-12-27 06:14:25,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c762407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:25, skipping insertion in model container [2019-12-27 06:14:25,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:14:25" (1/1) ... [2019-12-27 06:14:25,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:14:25,409 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:14:25,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:14:25,986 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:14:26,051 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:14:26,147 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:14:26,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26 WrapperNode [2019-12-27 06:14:26,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:14:26,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:14:26,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:14:26,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:14:26,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:14:26,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:14:26,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:14:26,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:14:26,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... [2019-12-27 06:14:26,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:14:26,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:14:26,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:14:26,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:14:26,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:14:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:14:26,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:14:26,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:14:26,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:14:26,370 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:14:26,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:14:26,371 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:14:26,373 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:14:26,373 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:14:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:14:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:14:26,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:14:26,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:14:26,376 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 06:14:27,354 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:14:27,355 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:14:27,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:27 BoogieIcfgContainer [2019-12-27 06:14:27,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:14:27,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:14:27,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:14:27,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:14:27,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:14:25" (1/3) ... [2019-12-27 06:14:27,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dd32d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:27, skipping insertion in model container [2019-12-27 06:14:27,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:14:26" (2/3) ... [2019-12-27 06:14:27,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79dd32d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:14:27, skipping insertion in model container [2019-12-27 06:14:27,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:14:27" (3/3) ... [2019-12-27 06:14:27,368 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_pso.oepc.i [2019-12-27 06:14:27,379 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:14:27,379 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:14:27,390 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:14:27,391 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:14:27,436 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,437 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,437 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,438 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,438 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,439 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,440 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,441 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,442 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,473 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,488 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,489 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,490 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,491 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,492 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,493 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,494 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,495 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,496 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,515 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,516 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,517 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,517 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,518 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,519 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,519 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,520 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,521 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,525 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,528 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,529 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:14:27,550 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:14:27,569 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:14:27,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:14:27,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:14:27,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:14:27,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:14:27,570 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:14:27,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:14:27,571 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:14:27,586 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-27 06:14:27,588 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 06:14:27,712 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 06:14:27,712 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:14:27,727 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:14:27,750 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-27 06:14:27,805 INFO L132 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-27 06:14:27,805 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:14:27,813 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:14:27,835 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:14:27,836 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:14:31,440 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-27 06:14:31,601 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-27 06:14:31,694 INFO L206 etLargeBlockEncoding]: Checked pairs total: 81109 [2019-12-27 06:14:31,695 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 06:14:31,698 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 06:14:48,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-27 06:14:48,381 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-27 06:14:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:14:48,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:48,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:14:48,388 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-27 06:14:48,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:48,395 INFO L82 PathProgramCache]: Analyzing trace with hash 924702, now seen corresponding path program 1 times [2019-12-27 06:14:48,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:48,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86062933] [2019-12-27 06:14:48,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:14:48,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86062933] [2019-12-27 06:14:48,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:48,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:14:48,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232254813] [2019-12-27 06:14:48,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:48,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:48,714 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-27 06:14:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:50,054 INFO L93 Difference]: Finished difference Result 108584 states and 463030 transitions. [2019-12-27 06:14:50,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:50,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:14:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:50,689 INFO L225 Difference]: With dead ends: 108584 [2019-12-27 06:14:50,692 INFO L226 Difference]: Without dead ends: 102344 [2019-12-27 06:14:50,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102344 states. [2019-12-27 06:14:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102344 to 102344. [2019-12-27 06:14:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102344 states. [2019-12-27 06:15:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102344 states to 102344 states and 435834 transitions. [2019-12-27 06:15:04,105 INFO L78 Accepts]: Start accepts. Automaton has 102344 states and 435834 transitions. Word has length 3 [2019-12-27 06:15:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:04,105 INFO L462 AbstractCegarLoop]: Abstraction has 102344 states and 435834 transitions. [2019-12-27 06:15:04,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 102344 states and 435834 transitions. [2019-12-27 06:15:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:15:04,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:04,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:04,108 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-27 06:15:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2092139601, now seen corresponding path program 1 times [2019-12-27 06:15:04,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:04,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463309611] [2019-12-27 06:15:04,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:04,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463309611] [2019-12-27 06:15:04,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:04,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:04,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149195743] [2019-12-27 06:15:04,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:04,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:04,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:04,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:04,231 INFO L87 Difference]: Start difference. First operand 102344 states and 435834 transitions. Second operand 4 states. [2019-12-27 06:15:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:09,757 INFO L93 Difference]: Finished difference Result 162816 states and 664963 transitions. [2019-12-27 06:15:09,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:09,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:15:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:10,394 INFO L225 Difference]: With dead ends: 162816 [2019-12-27 06:15:10,394 INFO L226 Difference]: Without dead ends: 162767 [2019-12-27 06:15:10,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162767 states. [2019-12-27 06:15:18,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162767 to 148375. [2019-12-27 06:15:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148375 states. [2019-12-27 06:15:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148375 states to 148375 states and 613985 transitions. [2019-12-27 06:15:18,527 INFO L78 Accepts]: Start accepts. Automaton has 148375 states and 613985 transitions. Word has length 11 [2019-12-27 06:15:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:18,527 INFO L462 AbstractCegarLoop]: Abstraction has 148375 states and 613985 transitions. [2019-12-27 06:15:18,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 148375 states and 613985 transitions. [2019-12-27 06:15:18,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:15:18,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:18,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:18,538 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-27 06:15:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2022218579, now seen corresponding path program 1 times [2019-12-27 06:15:18,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:18,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860798563] [2019-12-27 06:15:18,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:18,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860798563] [2019-12-27 06:15:18,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:18,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:18,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966499918] [2019-12-27 06:15:18,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:18,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:18,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:18,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:18,667 INFO L87 Difference]: Start difference. First operand 148375 states and 613985 transitions. Second operand 4 states. [2019-12-27 06:15:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:18,896 INFO L93 Difference]: Finished difference Result 43572 states and 149282 transitions. [2019-12-27 06:15:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:18,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 06:15:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:18,990 INFO L225 Difference]: With dead ends: 43572 [2019-12-27 06:15:18,990 INFO L226 Difference]: Without dead ends: 33443 [2019-12-27 06:15:18,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33443 states. [2019-12-27 06:15:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33443 to 33355. [2019-12-27 06:15:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33355 states. [2019-12-27 06:15:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33355 states to 33355 states and 108544 transitions. [2019-12-27 06:15:24,330 INFO L78 Accepts]: Start accepts. Automaton has 33355 states and 108544 transitions. Word has length 13 [2019-12-27 06:15:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:24,331 INFO L462 AbstractCegarLoop]: Abstraction has 33355 states and 108544 transitions. [2019-12-27 06:15:24,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:24,331 INFO L276 IsEmpty]: Start isEmpty. Operand 33355 states and 108544 transitions. [2019-12-27 06:15:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:24,335 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:24,335 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:24,335 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-27 06:15:24,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:24,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1339747598, now seen corresponding path program 1 times [2019-12-27 06:15:24,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:24,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33342871] [2019-12-27 06:15:24,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:24,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33342871] [2019-12-27 06:15:24,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:24,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:24,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794737230] [2019-12-27 06:15:24,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:24,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:24,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:24,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:24,402 INFO L87 Difference]: Start difference. First operand 33355 states and 108544 transitions. Second operand 3 states. [2019-12-27 06:15:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:24,632 INFO L93 Difference]: Finished difference Result 51737 states and 165591 transitions. [2019-12-27 06:15:24,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:24,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:15:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:24,718 INFO L225 Difference]: With dead ends: 51737 [2019-12-27 06:15:24,718 INFO L226 Difference]: Without dead ends: 51737 [2019-12-27 06:15:24,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51737 states. [2019-12-27 06:15:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51737 to 36950. [2019-12-27 06:15:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36950 states. [2019-12-27 06:15:25,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36950 states to 36950 states and 119471 transitions. [2019-12-27 06:15:25,698 INFO L78 Accepts]: Start accepts. Automaton has 36950 states and 119471 transitions. Word has length 16 [2019-12-27 06:15:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:25,698 INFO L462 AbstractCegarLoop]: Abstraction has 36950 states and 119471 transitions. [2019-12-27 06:15:25,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 36950 states and 119471 transitions. [2019-12-27 06:15:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:25,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:25,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:25,701 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-27 06:15:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1474909365, now seen corresponding path program 1 times [2019-12-27 06:15:25,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:25,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035985203] [2019-12-27 06:15:25,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:25,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035985203] [2019-12-27 06:15:25,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:25,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:25,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179751967] [2019-12-27 06:15:25,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:25,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:25,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:25,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:25,803 INFO L87 Difference]: Start difference. First operand 36950 states and 119471 transitions. Second operand 4 states. [2019-12-27 06:15:26,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:26,155 INFO L93 Difference]: Finished difference Result 43903 states and 140292 transitions. [2019-12-27 06:15:26,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:26,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:15:26,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:26,221 INFO L225 Difference]: With dead ends: 43903 [2019-12-27 06:15:26,221 INFO L226 Difference]: Without dead ends: 43903 [2019-12-27 06:15:26,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43903 states. [2019-12-27 06:15:27,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43903 to 40323. [2019-12-27 06:15:27,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40323 states. [2019-12-27 06:15:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40323 states to 40323 states and 129667 transitions. [2019-12-27 06:15:27,290 INFO L78 Accepts]: Start accepts. Automaton has 40323 states and 129667 transitions. Word has length 16 [2019-12-27 06:15:27,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:27,294 INFO L462 AbstractCegarLoop]: Abstraction has 40323 states and 129667 transitions. [2019-12-27 06:15:27,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 40323 states and 129667 transitions. [2019-12-27 06:15:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:27,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:27,298 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:27,298 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-27 06:15:27,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash 477780194, now seen corresponding path program 1 times [2019-12-27 06:15:27,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:27,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638207627] [2019-12-27 06:15:27,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:27,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638207627] [2019-12-27 06:15:27,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:27,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:27,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484151185] [2019-12-27 06:15:27,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:27,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:27,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:27,380 INFO L87 Difference]: Start difference. First operand 40323 states and 129667 transitions. Second operand 4 states. [2019-12-27 06:15:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:27,732 INFO L93 Difference]: Finished difference Result 47198 states and 150559 transitions. [2019-12-27 06:15:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:27,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 06:15:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:27,803 INFO L225 Difference]: With dead ends: 47198 [2019-12-27 06:15:27,803 INFO L226 Difference]: Without dead ends: 47198 [2019-12-27 06:15:27,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47198 states. [2019-12-27 06:15:28,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47198 to 41372. [2019-12-27 06:15:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41372 states. [2019-12-27 06:15:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41372 states to 41372 states and 132846 transitions. [2019-12-27 06:15:28,506 INFO L78 Accepts]: Start accepts. Automaton has 41372 states and 132846 transitions. Word has length 16 [2019-12-27 06:15:28,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:28,506 INFO L462 AbstractCegarLoop]: Abstraction has 41372 states and 132846 transitions. [2019-12-27 06:15:28,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 41372 states and 132846 transitions. [2019-12-27 06:15:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:15:28,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:28,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:28,515 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-27 06:15:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1115521539, now seen corresponding path program 1 times [2019-12-27 06:15:28,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:28,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104265015] [2019-12-27 06:15:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:29,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104265015] [2019-12-27 06:15:29,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:29,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:29,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497256379] [2019-12-27 06:15:29,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:29,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:29,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:29,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:29,081 INFO L87 Difference]: Start difference. First operand 41372 states and 132846 transitions. Second operand 6 states. [2019-12-27 06:15:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:29,693 INFO L93 Difference]: Finished difference Result 56140 states and 176467 transitions. [2019-12-27 06:15:29,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:15:29,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:15:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:29,785 INFO L225 Difference]: With dead ends: 56140 [2019-12-27 06:15:29,785 INFO L226 Difference]: Without dead ends: 56084 [2019-12-27 06:15:29,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56084 states. [2019-12-27 06:15:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56084 to 42682. [2019-12-27 06:15:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42682 states. [2019-12-27 06:15:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42682 states to 42682 states and 136797 transitions. [2019-12-27 06:15:30,597 INFO L78 Accepts]: Start accepts. Automaton has 42682 states and 136797 transitions. Word has length 22 [2019-12-27 06:15:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:30,598 INFO L462 AbstractCegarLoop]: Abstraction has 42682 states and 136797 transitions. [2019-12-27 06:15:30,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 42682 states and 136797 transitions. [2019-12-27 06:15:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:15:30,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:30,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:30,606 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-27 06:15:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash -715535694, now seen corresponding path program 1 times [2019-12-27 06:15:30,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:30,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244303405] [2019-12-27 06:15:30,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:30,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-27 06:15:30,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244303405] [2019-12-27 06:15:30,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:30,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:30,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375736961] [2019-12-27 06:15:30,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:30,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:30,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:30,714 INFO L87 Difference]: Start difference. First operand 42682 states and 136797 transitions. Second operand 6 states. [2019-12-27 06:15:31,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:31,704 INFO L93 Difference]: Finished difference Result 58326 states and 182865 transitions. [2019-12-27 06:15:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 06:15:31,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:15:31,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:31,798 INFO L225 Difference]: With dead ends: 58326 [2019-12-27 06:15:31,799 INFO L226 Difference]: Without dead ends: 58270 [2019-12-27 06:15:31,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58270 states. [2019-12-27 06:15:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58270 to 41190. [2019-12-27 06:15:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41190 states. [2019-12-27 06:15:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41190 states to 41190 states and 131910 transitions. [2019-12-27 06:15:32,590 INFO L78 Accepts]: Start accepts. Automaton has 41190 states and 131910 transitions. Word has length 22 [2019-12-27 06:15:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:32,591 INFO L462 AbstractCegarLoop]: Abstraction has 41190 states and 131910 transitions. [2019-12-27 06:15:32,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 41190 states and 131910 transitions. [2019-12-27 06:15:32,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:15:32,601 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:32,601 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:32,601 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-27 06:15:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:32,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1999797124, now seen corresponding path program 1 times [2019-12-27 06:15:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900945707] [2019-12-27 06:15:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:32,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:32,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900945707] [2019-12-27 06:15:32,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:32,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:32,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141891267] [2019-12-27 06:15:32,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:32,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:32,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:32,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:32,762 INFO L87 Difference]: Start difference. First operand 41190 states and 131910 transitions. Second operand 5 states. [2019-12-27 06:15:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:33,388 INFO L93 Difference]: Finished difference Result 57157 states and 178991 transitions. [2019-12-27 06:15:33,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:33,389 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 06:15:33,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:33,482 INFO L225 Difference]: With dead ends: 57157 [2019-12-27 06:15:33,483 INFO L226 Difference]: Without dead ends: 57144 [2019-12-27 06:15:33,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57144 states. [2019-12-27 06:15:34,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57144 to 47700. [2019-12-27 06:15:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47700 states. [2019-12-27 06:15:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47700 states to 47700 states and 152227 transitions. [2019-12-27 06:15:34,704 INFO L78 Accepts]: Start accepts. Automaton has 47700 states and 152227 transitions. Word has length 25 [2019-12-27 06:15:34,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:34,705 INFO L462 AbstractCegarLoop]: Abstraction has 47700 states and 152227 transitions. [2019-12-27 06:15:34,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47700 states and 152227 transitions. [2019-12-27 06:15:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:34,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:34,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:34,722 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-27 06:15:34,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 618087589, now seen corresponding path program 1 times [2019-12-27 06:15:34,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:34,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629924855] [2019-12-27 06:15:34,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:34,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629924855] [2019-12-27 06:15:34,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:34,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:34,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338416599] [2019-12-27 06:15:34,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:34,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:34,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:34,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:34,832 INFO L87 Difference]: Start difference. First operand 47700 states and 152227 transitions. Second operand 5 states. [2019-12-27 06:15:35,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:35,356 INFO L93 Difference]: Finished difference Result 59479 states and 186925 transitions. [2019-12-27 06:15:35,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:35,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 06:15:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:35,499 INFO L225 Difference]: With dead ends: 59479 [2019-12-27 06:15:35,499 INFO L226 Difference]: Without dead ends: 59303 [2019-12-27 06:15:35,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-27 06:15:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59303 states. [2019-12-27 06:15:36,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59303 to 52430. [2019-12-27 06:15:36,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52430 states. [2019-12-27 06:15:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52430 states to 52430 states and 166677 transitions. [2019-12-27 06:15:36,883 INFO L78 Accepts]: Start accepts. Automaton has 52430 states and 166677 transitions. Word has length 27 [2019-12-27 06:15:36,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:36,883 INFO L462 AbstractCegarLoop]: Abstraction has 52430 states and 166677 transitions. [2019-12-27 06:15:36,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 52430 states and 166677 transitions. [2019-12-27 06:15:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:36,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:36,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:36,900 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-27 06:15:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1155661138, now seen corresponding path program 1 times [2019-12-27 06:15:36,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:36,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741903882] [2019-12-27 06:15:36,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:36,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741903882] [2019-12-27 06:15:36,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:36,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:36,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280754018] [2019-12-27 06:15:36,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:36,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:36,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:36,938 INFO L87 Difference]: Start difference. First operand 52430 states and 166677 transitions. Second operand 3 states. [2019-12-27 06:15:37,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:37,216 INFO L93 Difference]: Finished difference Result 68400 states and 213391 transitions. [2019-12-27 06:15:37,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:37,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:15:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:37,330 INFO L225 Difference]: With dead ends: 68400 [2019-12-27 06:15:37,331 INFO L226 Difference]: Without dead ends: 68400 [2019-12-27 06:15:37,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68400 states. [2019-12-27 06:15:38,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68400 to 52430. [2019-12-27 06:15:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52430 states. [2019-12-27 06:15:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52430 states to 52430 states and 163576 transitions. [2019-12-27 06:15:38,767 INFO L78 Accepts]: Start accepts. Automaton has 52430 states and 163576 transitions. Word has length 27 [2019-12-27 06:15:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:38,768 INFO L462 AbstractCegarLoop]: Abstraction has 52430 states and 163576 transitions. [2019-12-27 06:15:38,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 52430 states and 163576 transitions. [2019-12-27 06:15:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:15:38,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:38,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:38,788 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-27 06:15:38,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:38,788 INFO L82 PathProgramCache]: Analyzing trace with hash -619607207, now seen corresponding path program 1 times [2019-12-27 06:15:38,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:38,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976690744] [2019-12-27 06:15:38,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:38,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976690744] [2019-12-27 06:15:38,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:38,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:38,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866729268] [2019-12-27 06:15:38,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:38,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:38,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:38,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:38,847 INFO L87 Difference]: Start difference. First operand 52430 states and 163576 transitions. Second operand 3 states. [2019-12-27 06:15:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:39,239 INFO L93 Difference]: Finished difference Result 83393 states and 260920 transitions. [2019-12-27 06:15:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:39,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-27 06:15:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:39,345 INFO L225 Difference]: With dead ends: 83393 [2019-12-27 06:15:39,345 INFO L226 Difference]: Without dead ends: 42141 [2019-12-27 06:15:39,346 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-27 06:15:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42141 states. [2019-12-27 06:15:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42141 to 41192. [2019-12-27 06:15:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41192 states. [2019-12-27 06:15:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41192 states to 41192 states and 126477 transitions. [2019-12-27 06:15:40,146 INFO L78 Accepts]: Start accepts. Automaton has 41192 states and 126477 transitions. Word has length 28 [2019-12-27 06:15:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:40,147 INFO L462 AbstractCegarLoop]: Abstraction has 41192 states and 126477 transitions. [2019-12-27 06:15:40,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 41192 states and 126477 transitions. [2019-12-27 06:15:40,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:15:40,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:40,161 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:40,161 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-27 06:15:40,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:40,162 INFO L82 PathProgramCache]: Analyzing trace with hash 176992031, now seen corresponding path program 1 times [2019-12-27 06:15:40,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:40,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595466831] [2019-12-27 06:15:40,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:40,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:40,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595466831] [2019-12-27 06:15:40,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:40,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:40,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472316837] [2019-12-27 06:15:40,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:40,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:40,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:40,243 INFO L87 Difference]: Start difference. First operand 41192 states and 126477 transitions. Second operand 5 states. [2019-12-27 06:15:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:40,973 INFO L93 Difference]: Finished difference Result 50691 states and 153433 transitions. [2019-12-27 06:15:40,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:40,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:15:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:41,049 INFO L225 Difference]: With dead ends: 50691 [2019-12-27 06:15:41,049 INFO L226 Difference]: Without dead ends: 50507 [2019-12-27 06:15:41,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-27 06:15:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50507 states. [2019-12-27 06:15:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50507 to 40218. [2019-12-27 06:15:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40218 states. [2019-12-27 06:15:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40218 states to 40218 states and 123251 transitions. [2019-12-27 06:15:41,770 INFO L78 Accepts]: Start accepts. Automaton has 40218 states and 123251 transitions. Word has length 28 [2019-12-27 06:15:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:41,770 INFO L462 AbstractCegarLoop]: Abstraction has 40218 states and 123251 transitions. [2019-12-27 06:15:41,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 40218 states and 123251 transitions. [2019-12-27 06:15:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 06:15:41,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:41,785 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] [2019-12-27 06:15:41,786 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-27 06:15:41,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 649649897, now seen corresponding path program 1 times [2019-12-27 06:15:41,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:41,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5625050] [2019-12-27 06:15:41,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:41,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5625050] [2019-12-27 06:15:41,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:41,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:15:41,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895597] [2019-12-27 06:15:41,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:41,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:41,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:41,831 INFO L87 Difference]: Start difference. First operand 40218 states and 123251 transitions. Second operand 3 states. [2019-12-27 06:15:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:42,009 INFO L93 Difference]: Finished difference Result 40188 states and 123165 transitions. [2019-12-27 06:15:42,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:42,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-27 06:15:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:42,112 INFO L225 Difference]: With dead ends: 40188 [2019-12-27 06:15:42,112 INFO L226 Difference]: Without dead ends: 40188 [2019-12-27 06:15:42,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40188 states. [2019-12-27 06:15:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40188 to 40188. [2019-12-27 06:15:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40188 states. [2019-12-27 06:15:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40188 states to 40188 states and 123165 transitions. [2019-12-27 06:15:43,317 INFO L78 Accepts]: Start accepts. Automaton has 40188 states and 123165 transitions. Word has length 29 [2019-12-27 06:15:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:43,317 INFO L462 AbstractCegarLoop]: Abstraction has 40188 states and 123165 transitions. [2019-12-27 06:15:43,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 40188 states and 123165 transitions. [2019-12-27 06:15:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:15:43,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:43,329 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] [2019-12-27 06:15:43,330 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-27 06:15:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1138402128, now seen corresponding path program 1 times [2019-12-27 06:15:43,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:43,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571056285] [2019-12-27 06:15:43,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:43,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:43,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571056285] [2019-12-27 06:15:43,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:43,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:43,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697468295] [2019-12-27 06:15:43,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:43,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:43,420 INFO L87 Difference]: Start difference. First operand 40188 states and 123165 transitions. Second operand 5 states. [2019-12-27 06:15:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:44,223 INFO L93 Difference]: Finished difference Result 58430 states and 176763 transitions. [2019-12-27 06:15:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:44,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 06:15:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:44,306 INFO L225 Difference]: With dead ends: 58430 [2019-12-27 06:15:44,306 INFO L226 Difference]: Without dead ends: 58423 [2019-12-27 06:15:44,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-27 06:15:44,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58423 states. [2019-12-27 06:15:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58423 to 47172. [2019-12-27 06:15:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47172 states. [2019-12-27 06:15:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47172 states to 47172 states and 144491 transitions. [2019-12-27 06:15:45,140 INFO L78 Accepts]: Start accepts. Automaton has 47172 states and 144491 transitions. Word has length 30 [2019-12-27 06:15:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:45,140 INFO L462 AbstractCegarLoop]: Abstraction has 47172 states and 144491 transitions. [2019-12-27 06:15:45,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 47172 states and 144491 transitions. [2019-12-27 06:15:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 06:15:45,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:45,159 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] [2019-12-27 06:15:45,159 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-27 06:15:45,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:45,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1330518716, now seen corresponding path program 1 times [2019-12-27 06:15:45,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:45,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121449612] [2019-12-27 06:15:45,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:45,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121449612] [2019-12-27 06:15:45,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:45,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:45,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460749706] [2019-12-27 06:15:45,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:45,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:45,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:45,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:45,230 INFO L87 Difference]: Start difference. First operand 47172 states and 144491 transitions. Second operand 5 states. [2019-12-27 06:15:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:45,369 INFO L93 Difference]: Finished difference Result 23265 states and 67117 transitions. [2019-12-27 06:15:45,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:45,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-27 06:15:45,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:45,416 INFO L225 Difference]: With dead ends: 23265 [2019-12-27 06:15:45,416 INFO L226 Difference]: Without dead ends: 20259 [2019-12-27 06:15:45,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20259 states. [2019-12-27 06:15:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20259 to 19184. [2019-12-27 06:15:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19184 states. [2019-12-27 06:15:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19184 states to 19184 states and 55388 transitions. [2019-12-27 06:15:46,353 INFO L78 Accepts]: Start accepts. Automaton has 19184 states and 55388 transitions. Word has length 30 [2019-12-27 06:15:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:46,353 INFO L462 AbstractCegarLoop]: Abstraction has 19184 states and 55388 transitions. [2019-12-27 06:15:46,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19184 states and 55388 transitions. [2019-12-27 06:15:46,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:15:46,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:46,370 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] [2019-12-27 06:15:46,371 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-27 06:15:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:46,371 INFO L82 PathProgramCache]: Analyzing trace with hash -154136683, now seen corresponding path program 1 times [2019-12-27 06:15:46,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:46,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415777633] [2019-12-27 06:15:46,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:46,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415777633] [2019-12-27 06:15:46,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:46,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:46,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090860939] [2019-12-27 06:15:46,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:46,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:46,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:46,466 INFO L87 Difference]: Start difference. First operand 19184 states and 55388 transitions. Second operand 6 states. [2019-12-27 06:15:46,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:46,764 INFO L93 Difference]: Finished difference Result 19784 states and 56830 transitions. [2019-12-27 06:15:46,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:46,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:15:46,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:46,790 INFO L225 Difference]: With dead ends: 19784 [2019-12-27 06:15:46,790 INFO L226 Difference]: Without dead ends: 19606 [2019-12-27 06:15:46,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19606 states. [2019-12-27 06:15:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19606 to 19203. [2019-12-27 06:15:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19203 states. [2019-12-27 06:15:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19203 states to 19203 states and 55404 transitions. [2019-12-27 06:15:47,059 INFO L78 Accepts]: Start accepts. Automaton has 19203 states and 55404 transitions. Word has length 33 [2019-12-27 06:15:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:47,059 INFO L462 AbstractCegarLoop]: Abstraction has 19203 states and 55404 transitions. [2019-12-27 06:15:47,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 19203 states and 55404 transitions. [2019-12-27 06:15:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:15:47,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:47,079 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] [2019-12-27 06:15:47,079 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-27 06:15:47,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:47,079 INFO L82 PathProgramCache]: Analyzing trace with hash 565784243, now seen corresponding path program 2 times [2019-12-27 06:15:47,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257082598] [2019-12-27 06:15:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257082598] [2019-12-27 06:15:47,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:47,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:47,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246474495] [2019-12-27 06:15:47,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:47,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:47,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:47,178 INFO L87 Difference]: Start difference. First operand 19203 states and 55404 transitions. Second operand 6 states. [2019-12-27 06:15:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:47,840 INFO L93 Difference]: Finished difference Result 25481 states and 72353 transitions. [2019-12-27 06:15:47,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:47,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-27 06:15:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:47,874 INFO L225 Difference]: With dead ends: 25481 [2019-12-27 06:15:47,874 INFO L226 Difference]: Without dead ends: 25171 [2019-12-27 06:15:47,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25171 states. [2019-12-27 06:15:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25171 to 20319. [2019-12-27 06:15:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20319 states. [2019-12-27 06:15:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20319 states to 20319 states and 58634 transitions. [2019-12-27 06:15:48,188 INFO L78 Accepts]: Start accepts. Automaton has 20319 states and 58634 transitions. Word has length 33 [2019-12-27 06:15:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:48,188 INFO L462 AbstractCegarLoop]: Abstraction has 20319 states and 58634 transitions. [2019-12-27 06:15:48,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20319 states and 58634 transitions. [2019-12-27 06:15:48,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 06:15:48,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:48,204 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] [2019-12-27 06:15:48,205 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-27 06:15:48,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:48,205 INFO L82 PathProgramCache]: Analyzing trace with hash 222292207, now seen corresponding path program 1 times [2019-12-27 06:15:48,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:48,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850460807] [2019-12-27 06:15:48,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:48,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:48,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850460807] [2019-12-27 06:15:48,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:48,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:48,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785541539] [2019-12-27 06:15:48,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:48,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:48,313 INFO L87 Difference]: Start difference. First operand 20319 states and 58634 transitions. Second operand 7 states. [2019-12-27 06:15:49,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:49,149 INFO L93 Difference]: Finished difference Result 25421 states and 72092 transitions. [2019-12-27 06:15:49,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:49,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 06:15:49,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:49,184 INFO L225 Difference]: With dead ends: 25421 [2019-12-27 06:15:49,184 INFO L226 Difference]: Without dead ends: 25046 [2019-12-27 06:15:49,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25046 states. [2019-12-27 06:15:49,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25046 to 18889. [2019-12-27 06:15:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18889 states. [2019-12-27 06:15:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18889 states to 18889 states and 54446 transitions. [2019-12-27 06:15:49,490 INFO L78 Accepts]: Start accepts. Automaton has 18889 states and 54446 transitions. Word has length 34 [2019-12-27 06:15:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:49,490 INFO L462 AbstractCegarLoop]: Abstraction has 18889 states and 54446 transitions. [2019-12-27 06:15:49,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 18889 states and 54446 transitions. [2019-12-27 06:15:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:15:49,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:49,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:49,508 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-27 06:15:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1519522478, now seen corresponding path program 1 times [2019-12-27 06:15:49,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:49,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698721026] [2019-12-27 06:15:49,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:49,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:49,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698721026] [2019-12-27 06:15:49,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:49,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:49,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935462853] [2019-12-27 06:15:49,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:49,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:49,646 INFO L87 Difference]: Start difference. First operand 18889 states and 54446 transitions. Second operand 7 states. [2019-12-27 06:15:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:50,836 INFO L93 Difference]: Finished difference Result 28051 states and 80696 transitions. [2019-12-27 06:15:50,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:15:50,837 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 06:15:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:50,874 INFO L225 Difference]: With dead ends: 28051 [2019-12-27 06:15:50,875 INFO L226 Difference]: Without dead ends: 28051 [2019-12-27 06:15:50,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:50,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28051 states. [2019-12-27 06:15:51,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28051 to 23336. [2019-12-27 06:15:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23336 states. [2019-12-27 06:15:51,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23336 states to 23336 states and 67958 transitions. [2019-12-27 06:15:51,231 INFO L78 Accepts]: Start accepts. Automaton has 23336 states and 67958 transitions. Word has length 40 [2019-12-27 06:15:51,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:51,231 INFO L462 AbstractCegarLoop]: Abstraction has 23336 states and 67958 transitions. [2019-12-27 06:15:51,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23336 states and 67958 transitions. [2019-12-27 06:15:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:15:51,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:51,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:51,255 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-27 06:15:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:51,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1795219358, now seen corresponding path program 2 times [2019-12-27 06:15:51,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:51,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329577255] [2019-12-27 06:15:51,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:51,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329577255] [2019-12-27 06:15:51,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:51,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:51,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089191189] [2019-12-27 06:15:51,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:51,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:51,352 INFO L87 Difference]: Start difference. First operand 23336 states and 67958 transitions. Second operand 7 states. [2019-12-27 06:15:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:52,748 INFO L93 Difference]: Finished difference Result 37528 states and 108180 transitions. [2019-12-27 06:15:52,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:15:52,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 06:15:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:52,832 INFO L225 Difference]: With dead ends: 37528 [2019-12-27 06:15:52,832 INFO L226 Difference]: Without dead ends: 37528 [2019-12-27 06:15:52,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:15:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37528 states. [2019-12-27 06:15:53,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37528 to 23721. [2019-12-27 06:15:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23721 states. [2019-12-27 06:15:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23721 states to 23721 states and 69032 transitions. [2019-12-27 06:15:53,324 INFO L78 Accepts]: Start accepts. Automaton has 23721 states and 69032 transitions. Word has length 40 [2019-12-27 06:15:53,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:53,325 INFO L462 AbstractCegarLoop]: Abstraction has 23721 states and 69032 transitions. [2019-12-27 06:15:53,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:53,325 INFO L276 IsEmpty]: Start isEmpty. Operand 23721 states and 69032 transitions. [2019-12-27 06:15:53,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:15:53,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:53,345 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:53,345 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-27 06:15:53,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -127696118, now seen corresponding path program 1 times [2019-12-27 06:15:53,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:53,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427158133] [2019-12-27 06:15:53,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:53,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:53,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427158133] [2019-12-27 06:15:53,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:53,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:53,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463151752] [2019-12-27 06:15:53,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:53,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:53,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:53,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:53,425 INFO L87 Difference]: Start difference. First operand 23721 states and 69032 transitions. Second operand 6 states. [2019-12-27 06:15:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:53,571 INFO L93 Difference]: Finished difference Result 22638 states and 66573 transitions. [2019-12-27 06:15:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 06:15:53,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 06:15:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:53,599 INFO L225 Difference]: With dead ends: 22638 [2019-12-27 06:15:53,599 INFO L226 Difference]: Without dead ends: 20409 [2019-12-27 06:15:53,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:53,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20409 states. [2019-12-27 06:15:53,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20409 to 19310. [2019-12-27 06:15:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19310 states. [2019-12-27 06:15:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19310 states to 19310 states and 58460 transitions. [2019-12-27 06:15:53,891 INFO L78 Accepts]: Start accepts. Automaton has 19310 states and 58460 transitions. Word has length 41 [2019-12-27 06:15:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:53,891 INFO L462 AbstractCegarLoop]: Abstraction has 19310 states and 58460 transitions. [2019-12-27 06:15:53,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 19310 states and 58460 transitions. [2019-12-27 06:15:53,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:53,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:53,909 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] [2019-12-27 06:15:53,909 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:53,910 INFO L82 PathProgramCache]: Analyzing trace with hash 330882346, now seen corresponding path program 1 times [2019-12-27 06:15:53,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:53,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074012640] [2019-12-27 06:15:53,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:53,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074012640] [2019-12-27 06:15:53,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:53,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:53,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555854662] [2019-12-27 06:15:53,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:53,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:53,989 INFO L87 Difference]: Start difference. First operand 19310 states and 58460 transitions. Second operand 7 states. [2019-12-27 06:15:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:54,687 INFO L93 Difference]: Finished difference Result 57580 states and 172069 transitions. [2019-12-27 06:15:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:54,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:15:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:54,744 INFO L225 Difference]: With dead ends: 57580 [2019-12-27 06:15:54,745 INFO L226 Difference]: Without dead ends: 40966 [2019-12-27 06:15:54,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:15:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-12-27 06:15:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 22621. [2019-12-27 06:15:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22621 states. [2019-12-27 06:15:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22621 states to 22621 states and 68118 transitions. [2019-12-27 06:15:55,214 INFO L78 Accepts]: Start accepts. Automaton has 22621 states and 68118 transitions. Word has length 64 [2019-12-27 06:15:55,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:55,214 INFO L462 AbstractCegarLoop]: Abstraction has 22621 states and 68118 transitions. [2019-12-27 06:15:55,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:55,214 INFO L276 IsEmpty]: Start isEmpty. Operand 22621 states and 68118 transitions. [2019-12-27 06:15:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:55,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:55,240 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] [2019-12-27 06:15:55,240 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:55,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2090384824, now seen corresponding path program 2 times [2019-12-27 06:15:55,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:55,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805861705] [2019-12-27 06:15:55,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:55,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805861705] [2019-12-27 06:15:55,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:55,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:55,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7382517] [2019-12-27 06:15:55,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:55,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:55,331 INFO L87 Difference]: Start difference. First operand 22621 states and 68118 transitions. Second operand 7 states. [2019-12-27 06:15:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:56,038 INFO L93 Difference]: Finished difference Result 62359 states and 184653 transitions. [2019-12-27 06:15:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:56,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:15:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:56,137 INFO L225 Difference]: With dead ends: 62359 [2019-12-27 06:15:56,137 INFO L226 Difference]: Without dead ends: 43603 [2019-12-27 06:15:56,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:15:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43603 states. [2019-12-27 06:15:56,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43603 to 25797. [2019-12-27 06:15:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25797 states. [2019-12-27 06:15:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25797 states to 25797 states and 77073 transitions. [2019-12-27 06:15:56,819 INFO L78 Accepts]: Start accepts. Automaton has 25797 states and 77073 transitions. Word has length 64 [2019-12-27 06:15:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:56,819 INFO L462 AbstractCegarLoop]: Abstraction has 25797 states and 77073 transitions. [2019-12-27 06:15:56,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:56,820 INFO L276 IsEmpty]: Start isEmpty. Operand 25797 states and 77073 transitions. [2019-12-27 06:15:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:56,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:56,846 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] [2019-12-27 06:15:56,846 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:56,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1426472092, now seen corresponding path program 3 times [2019-12-27 06:15:56,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:56,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826087197] [2019-12-27 06:15:56,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:56,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826087197] [2019-12-27 06:15:56,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:56,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:56,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623961126] [2019-12-27 06:15:56,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:56,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:56,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:56,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:56,936 INFO L87 Difference]: Start difference. First operand 25797 states and 77073 transitions. Second operand 7 states. [2019-12-27 06:15:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:57,402 INFO L93 Difference]: Finished difference Result 51800 states and 153143 transitions. [2019-12-27 06:15:57,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:15:57,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 06:15:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:57,465 INFO L225 Difference]: With dead ends: 51800 [2019-12-27 06:15:57,465 INFO L226 Difference]: Without dead ends: 46999 [2019-12-27 06:15:57,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:15:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46999 states. [2019-12-27 06:15:58,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46999 to 25997. [2019-12-27 06:15:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25997 states. [2019-12-27 06:15:58,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25997 states to 25997 states and 77717 transitions. [2019-12-27 06:15:58,329 INFO L78 Accepts]: Start accepts. Automaton has 25997 states and 77717 transitions. Word has length 64 [2019-12-27 06:15:58,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:58,330 INFO L462 AbstractCegarLoop]: Abstraction has 25997 states and 77717 transitions. [2019-12-27 06:15:58,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:58,330 INFO L276 IsEmpty]: Start isEmpty. Operand 25997 states and 77717 transitions. [2019-12-27 06:15:58,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 06:15:58,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:58,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:58,358 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:58,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:58,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1972483448, now seen corresponding path program 4 times [2019-12-27 06:15:58,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:58,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545262330] [2019-12-27 06:15:58,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:58,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:58,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545262330] [2019-12-27 06:15:58,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:58,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:58,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874818420] [2019-12-27 06:15:58,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:58,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:58,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:58,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:58,420 INFO L87 Difference]: Start difference. First operand 25997 states and 77717 transitions. Second operand 3 states. [2019-12-27 06:15:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:58,608 INFO L93 Difference]: Finished difference Result 32634 states and 97297 transitions. [2019-12-27 06:15:58,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:58,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 06:15:58,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:58,665 INFO L225 Difference]: With dead ends: 32634 [2019-12-27 06:15:58,665 INFO L226 Difference]: Without dead ends: 32634 [2019-12-27 06:15:58,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32634 states. [2019-12-27 06:15:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32634 to 27238. [2019-12-27 06:15:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27238 states. [2019-12-27 06:15:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27238 states to 27238 states and 81651 transitions. [2019-12-27 06:15:59,099 INFO L78 Accepts]: Start accepts. Automaton has 27238 states and 81651 transitions. Word has length 64 [2019-12-27 06:15:59,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:59,099 INFO L462 AbstractCegarLoop]: Abstraction has 27238 states and 81651 transitions. [2019-12-27 06:15:59,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:59,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27238 states and 81651 transitions. [2019-12-27 06:15:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:59,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:59,126 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-27 06:15:59,126 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:15:59,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:59,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1933518544, now seen corresponding path program 1 times [2019-12-27 06:15:59,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:59,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829190515] [2019-12-27 06:15:59,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:59,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829190515] [2019-12-27 06:15:59,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:59,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:59,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54996043] [2019-12-27 06:15:59,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:59,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:59,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:59,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:59,198 INFO L87 Difference]: Start difference. First operand 27238 states and 81651 transitions. Second operand 7 states. [2019-12-27 06:15:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:59,846 INFO L93 Difference]: Finished difference Result 58045 states and 173030 transitions. [2019-12-27 06:15:59,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:15:59,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:15:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:59,920 INFO L225 Difference]: With dead ends: 58045 [2019-12-27 06:15:59,920 INFO L226 Difference]: Without dead ends: 51900 [2019-12-27 06:15:59,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 06:16:00,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51900 states. [2019-12-27 06:16:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51900 to 27540. [2019-12-27 06:16:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27540 states. [2019-12-27 06:16:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27540 states to 27540 states and 82675 transitions. [2019-12-27 06:16:00,494 INFO L78 Accepts]: Start accepts. Automaton has 27540 states and 82675 transitions. Word has length 65 [2019-12-27 06:16:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:00,494 INFO L462 AbstractCegarLoop]: Abstraction has 27540 states and 82675 transitions. [2019-12-27 06:16:00,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:16:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27540 states and 82675 transitions. [2019-12-27 06:16:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:16:00,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:00,523 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-27 06:16:00,524 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:00,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1868643674, now seen corresponding path program 1 times [2019-12-27 06:16:00,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:00,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399267486] [2019-12-27 06:16:00,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:00,995 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-12-27 06:16:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:01,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399267486] [2019-12-27 06:16:01,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:01,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729222784] [2019-12-27 06:16:01,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 06:16:01,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:01,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 06:16:01,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:16:01,090 INFO L87 Difference]: Start difference. First operand 27540 states and 82675 transitions. Second operand 9 states. [2019-12-27 06:16:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:02,685 INFO L93 Difference]: Finished difference Result 37234 states and 109743 transitions. [2019-12-27 06:16:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 06:16:02,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 06:16:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:02,736 INFO L225 Difference]: With dead ends: 37234 [2019-12-27 06:16:02,736 INFO L226 Difference]: Without dead ends: 37234 [2019-12-27 06:16:02,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-27 06:16:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37234 states. [2019-12-27 06:16:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37234 to 30624. [2019-12-27 06:16:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30624 states. [2019-12-27 06:16:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30624 states to 30624 states and 91365 transitions. [2019-12-27 06:16:03,253 INFO L78 Accepts]: Start accepts. Automaton has 30624 states and 91365 transitions. Word has length 65 [2019-12-27 06:16:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:03,254 INFO L462 AbstractCegarLoop]: Abstraction has 30624 states and 91365 transitions. [2019-12-27 06:16:03,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 06:16:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 30624 states and 91365 transitions. [2019-12-27 06:16:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:16:03,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:03,285 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-27 06:16:03,285 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1340051100, now seen corresponding path program 2 times [2019-12-27 06:16:03,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:03,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952449893] [2019-12-27 06:16:03,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:03,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952449893] [2019-12-27 06:16:03,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:03,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:03,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877394227] [2019-12-27 06:16:03,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:03,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:03,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:03,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:03,344 INFO L87 Difference]: Start difference. First operand 30624 states and 91365 transitions. Second operand 3 states. [2019-12-27 06:16:03,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:03,431 INFO L93 Difference]: Finished difference Result 30623 states and 91363 transitions. [2019-12-27 06:16:03,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:03,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:16:03,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:03,472 INFO L225 Difference]: With dead ends: 30623 [2019-12-27 06:16:03,472 INFO L226 Difference]: Without dead ends: 30623 [2019-12-27 06:16:03,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30623 states. [2019-12-27 06:16:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30623 to 21159. [2019-12-27 06:16:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21159 states. [2019-12-27 06:16:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21159 states to 21159 states and 64759 transitions. [2019-12-27 06:16:03,850 INFO L78 Accepts]: Start accepts. Automaton has 21159 states and 64759 transitions. Word has length 65 [2019-12-27 06:16:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:03,851 INFO L462 AbstractCegarLoop]: Abstraction has 21159 states and 64759 transitions. [2019-12-27 06:16:03,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 21159 states and 64759 transitions. [2019-12-27 06:16:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:16:03,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:03,883 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-27 06:16:03,883 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash 251376720, now seen corresponding path program 1 times [2019-12-27 06:16:03,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:03,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015204472] [2019-12-27 06:16:03,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:03,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015204472] [2019-12-27 06:16:03,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:03,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:16:03,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481388527] [2019-12-27 06:16:03,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:16:03,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:03,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:16:03,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:03,948 INFO L87 Difference]: Start difference. First operand 21159 states and 64759 transitions. Second operand 3 states. [2019-12-27 06:16:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:04,025 INFO L93 Difference]: Finished difference Result 16366 states and 49280 transitions. [2019-12-27 06:16:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:16:04,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 06:16:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:04,051 INFO L225 Difference]: With dead ends: 16366 [2019-12-27 06:16:04,051 INFO L226 Difference]: Without dead ends: 16366 [2019-12-27 06:16:04,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:16:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16366 states. [2019-12-27 06:16:04,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16366 to 14264. [2019-12-27 06:16:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14264 states. [2019-12-27 06:16:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14264 states to 14264 states and 43005 transitions. [2019-12-27 06:16:04,271 INFO L78 Accepts]: Start accepts. Automaton has 14264 states and 43005 transitions. Word has length 66 [2019-12-27 06:16:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:04,271 INFO L462 AbstractCegarLoop]: Abstraction has 14264 states and 43005 transitions. [2019-12-27 06:16:04,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:16:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14264 states and 43005 transitions. [2019-12-27 06:16:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:04,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:04,285 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-27 06:16:04,286 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:04,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:04,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1185518723, now seen corresponding path program 1 times [2019-12-27 06:16:04,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:04,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121979780] [2019-12-27 06:16:04,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:04,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121979780] [2019-12-27 06:16:04,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:04,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:04,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750976712] [2019-12-27 06:16:04,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:16:04,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:04,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:16:04,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:16:04,485 INFO L87 Difference]: Start difference. First operand 14264 states and 43005 transitions. Second operand 11 states. [2019-12-27 06:16:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:05,913 INFO L93 Difference]: Finished difference Result 35658 states and 107344 transitions. [2019-12-27 06:16:05,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 06:16:05,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:16:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:05,959 INFO L225 Difference]: With dead ends: 35658 [2019-12-27 06:16:05,959 INFO L226 Difference]: Without dead ends: 33143 [2019-12-27 06:16:05,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-27 06:16:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33143 states. [2019-12-27 06:16:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33143 to 18310. [2019-12-27 06:16:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18310 states. [2019-12-27 06:16:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18310 states to 18310 states and 55031 transitions. [2019-12-27 06:16:06,337 INFO L78 Accepts]: Start accepts. Automaton has 18310 states and 55031 transitions. Word has length 67 [2019-12-27 06:16:06,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:06,337 INFO L462 AbstractCegarLoop]: Abstraction has 18310 states and 55031 transitions. [2019-12-27 06:16:06,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:16:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 18310 states and 55031 transitions. [2019-12-27 06:16:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:06,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:06,357 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-27 06:16:06,357 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1856066161, now seen corresponding path program 2 times [2019-12-27 06:16:06,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:06,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58761279] [2019-12-27 06:16:06,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:06,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:06,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58761279] [2019-12-27 06:16:06,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:06,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:06,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086932337] [2019-12-27 06:16:06,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:16:06,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:16:06,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:16:06,556 INFO L87 Difference]: Start difference. First operand 18310 states and 55031 transitions. Second operand 11 states. [2019-12-27 06:16:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:07,577 INFO L93 Difference]: Finished difference Result 33820 states and 100854 transitions. [2019-12-27 06:16:07,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:16:07,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:16:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:07,613 INFO L225 Difference]: With dead ends: 33820 [2019-12-27 06:16:07,613 INFO L226 Difference]: Without dead ends: 26030 [2019-12-27 06:16:07,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-27 06:16:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26030 states. [2019-12-27 06:16:07,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26030 to 14207. [2019-12-27 06:16:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14207 states. [2019-12-27 06:16:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14207 states to 14207 states and 42327 transitions. [2019-12-27 06:16:07,911 INFO L78 Accepts]: Start accepts. Automaton has 14207 states and 42327 transitions. Word has length 67 [2019-12-27 06:16:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:07,911 INFO L462 AbstractCegarLoop]: Abstraction has 14207 states and 42327 transitions. [2019-12-27 06:16:07,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:16:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14207 states and 42327 transitions. [2019-12-27 06:16:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:07,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:07,926 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-27 06:16:07,926 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:07,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:07,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1959201465, now seen corresponding path program 3 times [2019-12-27 06:16:07,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:07,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766098366] [2019-12-27 06:16:07,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:08,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:16:08,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766098366] [2019-12-27 06:16:08,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:08,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:16:08,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609834458] [2019-12-27 06:16:08,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:16:08,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:08,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:16:08,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:16:08,094 INFO L87 Difference]: Start difference. First operand 14207 states and 42327 transitions. Second operand 12 states. [2019-12-27 06:16:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:09,001 INFO L93 Difference]: Finished difference Result 26521 states and 78757 transitions. [2019-12-27 06:16:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:16:09,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:16:09,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:09,037 INFO L225 Difference]: With dead ends: 26521 [2019-12-27 06:16:09,038 INFO L226 Difference]: Without dead ends: 25594 [2019-12-27 06:16:09,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:16:09,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25594 states. [2019-12-27 06:16:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25594 to 13539. [2019-12-27 06:16:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13539 states. [2019-12-27 06:16:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13539 states to 13539 states and 40488 transitions. [2019-12-27 06:16:09,324 INFO L78 Accepts]: Start accepts. Automaton has 13539 states and 40488 transitions. Word has length 67 [2019-12-27 06:16:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:09,324 INFO L462 AbstractCegarLoop]: Abstraction has 13539 states and 40488 transitions. [2019-12-27 06:16:09,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:16:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13539 states and 40488 transitions. [2019-12-27 06:16:09,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:09,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:09,339 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-27 06:16:09,340 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:16:09,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:09,340 INFO L82 PathProgramCache]: Analyzing trace with hash -49234465, now seen corresponding path program 4 times [2019-12-27 06:16:09,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:09,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681246868] [2019-12-27 06:16:09,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:09,467 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:16:09,467 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:16:09,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [906] [906] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~b$r_buff0_thd3~0_78) (= v_~main$tmp_guard0~0_10 0) (= v_~b$r_buff1_thd1~0_21 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~weak$$choice0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t879~0.base_22|)) (= |v_#NULL.offset_6| 0) (= 0 v_~b$r_buff0_thd0~0_22) (= 0 v_~b$r_buff0_thd2~0_19) (= 0 v_~b$w_buff1_used~0_75) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$w_buff0~0_26) (< 0 |v_#StackHeapBarrier_19|) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= 0 v_~weak$$choice2~0_34) (= |v_ULTIMATE.start_main_~#t879~0.offset_18| 0) (= v_~b$r_buff1_thd2~0_21 0) (= 0 v_~a~0_7) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t879~0.base_22| 1)) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~b$r_buff1_thd3~0_52 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_cnt~0_19) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t879~0.base_22| 4)) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~b$w_buff1~0_25) (= v_~b$flush_delayed~0_12 0) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t879~0.base_22| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t879~0.base_22|) |v_ULTIMATE.start_main_~#t879~0.offset_18| 0)) |v_#memory_int_25|) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t879~0.base_22|) (= 0 v_~z~0_9) (= v_~__unbuffered_p1_EBX~0_13 0) (= v_~main$tmp_guard1~0_12 0) (= 0 v_~b$w_buff0_used~0_116) (= 0 v_~b$read_delayed_var~0.base_7) (= v_~x~0_16 0) (= v_~b$r_buff1_thd0~0_21 0) (= v_~b~0_26 0) (= 0 v_~b$r_buff0_thd1~0_28) (= 0 v_~b$mem_tmp~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_21, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_12|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_10|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_10|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_116, ~a~0=v_~a~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start_main_~#t880~0.offset=|v_ULTIMATE.start_main_~#t880~0.offset_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_22, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_19, ~b$mem_tmp~0=v_~b$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ~b$flush_delayed~0=v_~b$flush_delayed~0_12, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~b$w_buff1~0=v_~b$w_buff1~0_25, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x~0=v_~x~0_16, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_28, ULTIMATE.start_main_~#t881~0.offset=|v_ULTIMATE.start_main_~#t881~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_~#t881~0.base=|v_ULTIMATE.start_main_~#t881~0.base_18|, ULTIMATE.start_main_~#t879~0.offset=|v_ULTIMATE.start_main_~#t879~0.offset_18|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_10|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_75, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_21, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_21, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t879~0.base=|v_ULTIMATE.start_main_~#t879~0.base_22|, ~b~0=v_~b~0_26, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_~#t880~0.base=|v_ULTIMATE.start_main_~#t880~0.base_20|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_52} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t880~0.offset, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ULTIMATE.start_main_~#t881~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t881~0.base, ULTIMATE.start_main_~#t879~0.offset, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ~y~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t879~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t880~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:16:09,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L840-1-->L842: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t880~0.base_12| 1)) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t880~0.base_12|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t880~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t880~0.base_12|) |v_ULTIMATE.start_main_~#t880~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t880~0.base_12|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t880~0.base_12| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t880~0.offset_10|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t880~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t880~0.offset=|v_ULTIMATE.start_main_~#t880~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t880~0.base=|v_ULTIMATE.start_main_~#t880~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t880~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t880~0.base, #length] because there is no mapped edge [2019-12-27 06:16:09,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L752: Formula: (and (= ~b$r_buff1_thd2~0_Out495447552 ~b$r_buff0_thd2~0_In495447552) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In495447552 0)) (= ~b$r_buff0_thd0~0_In495447552 ~b$r_buff1_thd0~0_Out495447552) (= 1 ~x~0_Out495447552) (= ~b$r_buff1_thd1~0_Out495447552 ~b$r_buff0_thd1~0_In495447552) (= ~b$r_buff0_thd1~0_Out495447552 1) (= ~b$r_buff1_thd3~0_Out495447552 ~b$r_buff0_thd3~0_In495447552)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In495447552, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In495447552, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In495447552, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In495447552, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In495447552} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out495447552, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In495447552, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In495447552, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out495447552, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out495447552, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In495447552, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out495447552, ~x~0=~x~0_Out495447552, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out495447552, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In495447552} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~x~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:16:09,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L778-2-->L778-5: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd2~0_In547988157 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In547988157 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out547988157| |P1Thread1of1ForFork2_#t~ite9_Out547988157|))) (or (and .cse0 (or .cse1 .cse2) (= ~b~0_In547988157 |P1Thread1of1ForFork2_#t~ite9_Out547988157|)) (and (not .cse1) (not .cse2) .cse0 (= ~b$w_buff1~0_In547988157 |P1Thread1of1ForFork2_#t~ite9_Out547988157|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In547988157, ~b~0=~b~0_In547988157, ~b$w_buff1~0=~b$w_buff1~0_In547988157, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In547988157} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out547988157|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In547988157, ~b~0=~b~0_In547988157, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out547988157|, ~b$w_buff1~0=~b$w_buff1~0_In547988157, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In547988157} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 06:16:09,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In37675042 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In37675042 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out37675042| ~b$w_buff0_used~0_In37675042)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out37675042|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In37675042, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In37675042} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In37675042, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out37675042|, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In37675042} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 06:16:09,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In385090816 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In385090816 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In385090816 256))) (.cse2 (= (mod ~b$r_buff0_thd1~0_In385090816 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out385090816| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite6_Out385090816| ~b$w_buff1_used~0_In385090816)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In385090816, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In385090816, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In385090816, ~b$w_buff1_used~0=~b$w_buff1_used~0_In385090816} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In385090816, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In385090816, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In385090816, ~b$w_buff1_used~0=~b$w_buff1_used~0_In385090816, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out385090816|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 06:16:09,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1526213619 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-1526213619 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-1526213619| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-1526213619| ~b$w_buff0_used~0_In-1526213619)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1526213619, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1526213619} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1526213619, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1526213619, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1526213619|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 06:16:09,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L755-->L756: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In1807419488 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In1807419488 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd1~0_In1807419488 ~b$r_buff0_thd1~0_Out1807419488)) (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out1807419488) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1807419488, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1807419488} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1807419488, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1807419488, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1807419488|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-27 06:16:09,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L756-->L756-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In-774055887 256))) (.cse3 (= (mod ~b$r_buff0_thd1~0_In-774055887 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In-774055887 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd1~0_In-774055887 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-774055887|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~b$r_buff1_thd1~0_In-774055887 |P0Thread1of1ForFork1_#t~ite8_Out-774055887|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-774055887, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-774055887, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-774055887, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-774055887} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-774055887, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-774055887, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-774055887, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-774055887|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-774055887} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 06:16:09,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L756-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~b$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_17, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:16:09,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t881~0.base_12|)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t881~0.base_12| 1) |v_#valid_36|) (= 0 |v_ULTIMATE.start_main_~#t881~0.offset_10|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t881~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t881~0.base_12| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t881~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t881~0.base_12|) |v_ULTIMATE.start_main_~#t881~0.offset_10| 2)) |v_#memory_int_15|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t881~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t881~0.offset=|v_ULTIMATE.start_main_~#t881~0.offset_10|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t881~0.base=|v_ULTIMATE.start_main_~#t881~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t881~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t881~0.base] because there is no mapped edge [2019-12-27 06:16:09,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L809-->L809-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1068550801 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1068550801| ~b$w_buff1_used~0_In-1068550801) (= |P2Thread1of1ForFork0_#t~ite29_In-1068550801| |P2Thread1of1ForFork0_#t~ite29_Out-1068550801|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite30_Out-1068550801| |P2Thread1of1ForFork0_#t~ite29_Out-1068550801|) (= ~b$w_buff1_used~0_In-1068550801 |P2Thread1of1ForFork0_#t~ite29_Out-1068550801|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1068550801 256) 0))) (or (and .cse1 (= (mod ~b$r_buff1_thd3~0_In-1068550801 256) 0)) (= 0 (mod ~b$w_buff0_used~0_In-1068550801 256)) (and (= 0 (mod ~b$w_buff1_used~0_In-1068550801 256)) .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1068550801, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1068550801, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1068550801, ~weak$$choice2~0=~weak$$choice2~0_In-1068550801, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1068550801|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1068550801} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1068550801, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1068550801, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1068550801, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1068550801|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1068550801|, ~weak$$choice2~0=~weak$$choice2~0_In-1068550801, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1068550801} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 06:16:09,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L810-->L811: Formula: (and (not (= (mod v_~weak$$choice2~0_18 256) 0)) (= v_~b$r_buff0_thd3~0_58 v_~b$r_buff0_thd3~0_57)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_18} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_57, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_8|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_10|, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_9|, ~weak$$choice2~0=v_~weak$$choice2~0_18} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 06:16:09,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L811-->L811-8: Formula: (let ((.cse5 (= 0 (mod ~b$w_buff1_used~0_In2021448879 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In2021448879 256))) (.cse6 (= (mod ~b$r_buff0_thd3~0_In2021448879 256) 0)) (.cse2 (= (mod ~b$r_buff1_thd3~0_In2021448879 256) 0)) (.cse4 (= |P2Thread1of1ForFork0_#t~ite36_Out2021448879| |P2Thread1of1ForFork0_#t~ite35_Out2021448879|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In2021448879 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 (or (not .cse2) .cse3) .cse4 (= |P2Thread1of1ForFork0_#t~ite34_Out2021448879| 0) (or .cse3 (not .cse5)) (= |P2Thread1of1ForFork0_#t~ite34_Out2021448879| |P2Thread1of1ForFork0_#t~ite35_Out2021448879|))) (and (or (and .cse1 (or (and .cse5 .cse6) .cse0 (and .cse6 .cse2)) .cse4 (= ~b$r_buff1_thd3~0_In2021448879 |P2Thread1of1ForFork0_#t~ite35_Out2021448879|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite35_Out2021448879| |P2Thread1of1ForFork0_#t~ite35_In2021448879|) (= ~b$r_buff1_thd3~0_In2021448879 |P2Thread1of1ForFork0_#t~ite36_Out2021448879|))) (= |P2Thread1of1ForFork0_#t~ite34_In2021448879| |P2Thread1of1ForFork0_#t~ite34_Out2021448879|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2021448879, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2021448879, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2021448879, P2Thread1of1ForFork0_#t~ite35=|P2Thread1of1ForFork0_#t~ite35_In2021448879|, P2Thread1of1ForFork0_#t~ite34=|P2Thread1of1ForFork0_#t~ite34_In2021448879|, ~weak$$choice2~0=~weak$$choice2~0_In2021448879, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2021448879} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2021448879, P2Thread1of1ForFork0_#t~ite36=|P2Thread1of1ForFork0_#t~ite36_Out2021448879|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2021448879, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2021448879, P2Thread1of1ForFork0_#t~ite35=|P2Thread1of1ForFork0_#t~ite35_Out2021448879|, P2Thread1of1ForFork0_#t~ite34=|P2Thread1of1ForFork0_#t~ite34_Out2021448879|, ~weak$$choice2~0=~weak$$choice2~0_In2021448879, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2021448879} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 06:16:09,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L813-->L817: Formula: (and (= v_~b$flush_delayed~0_6 0) (not (= (mod v_~b$flush_delayed~0_7 256) 0)) (= v_~b~0_16 v_~b$mem_tmp~0_4)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b~0=v_~b~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 06:16:09,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L817-2-->L817-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork0_#t~ite39_Out1020673082| |P2Thread1of1ForFork0_#t~ite38_Out1020673082|)) (.cse1 (= (mod ~b$w_buff1_used~0_In1020673082 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd3~0_In1020673082 256) 0))) (or (and (= ~b$w_buff1~0_In1020673082 |P2Thread1of1ForFork0_#t~ite38_Out1020673082|) (not .cse0) (not .cse1) .cse2) (and (= |P2Thread1of1ForFork0_#t~ite38_Out1020673082| ~b~0_In1020673082) .cse2 (or .cse1 .cse0)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In1020673082, ~b~0=~b~0_In1020673082, ~b$w_buff1~0=~b$w_buff1~0_In1020673082, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1020673082} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1020673082|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1020673082|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1020673082, ~b~0=~b~0_In1020673082, ~b$w_buff1~0=~b$w_buff1~0_In1020673082, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1020673082} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 06:16:09,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-1672811737 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1672811737 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1672811737| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-1672811737| ~b$w_buff0_used~0_In-1672811737)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1672811737, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1672811737} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1672811737, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1672811737, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1672811737|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 06:16:09,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-2145233592 256))) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-2145233592 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In-2145233592 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-2145233592 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-2145233592| ~b$w_buff1_used~0_In-2145233592)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2145233592| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2145233592, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2145233592, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2145233592, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2145233592} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2145233592, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2145233592, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2145233592, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2145233592|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2145233592} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 06:16:09,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1920670761 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1920670761 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd3~0_In1920670761 |P2Thread1of1ForFork0_#t~ite42_Out1920670761|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1920670761|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1920670761, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1920670761} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1920670761, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1920670761, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1920670761|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 06:16:09,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In-998987123 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-998987123 256))) (.cse2 (= (mod ~b$w_buff1_used~0_In-998987123 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In-998987123 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-998987123|)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite43_Out-998987123| ~b$r_buff1_thd3~0_In-998987123)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-998987123, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-998987123, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-998987123, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-998987123} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-998987123, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-998987123, P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-998987123|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-998987123, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-998987123} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 06:16:09,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork0_#t~ite43_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 06:16:09,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L780-->L780-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff0_thd2~0_In110729219 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In110729219 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In110729219 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd2~0_In110729219 256) 0))) (or (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In110729219 |P1Thread1of1ForFork2_#t~ite12_Out110729219|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out110729219|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In110729219, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In110729219, ~b$w_buff1_used~0=~b$w_buff1_used~0_In110729219, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In110729219} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In110729219, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In110729219, ~b$w_buff1_used~0=~b$w_buff1_used~0_In110729219, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out110729219|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In110729219} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 06:16:09,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-1462676763 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1462676763 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd2~0_In-1462676763 |P1Thread1of1ForFork2_#t~ite13_Out-1462676763|)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-1462676763| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1462676763, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1462676763} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1462676763, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1462676763, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1462676763|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 06:16:09,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1634035157 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In-1634035157 256))) (.cse2 (= (mod ~b$r_buff0_thd2~0_In-1634035157 256) 0)) (.cse3 (= (mod ~b$w_buff0_used~0_In-1634035157 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1634035157| ~b$r_buff1_thd2~0_In-1634035157)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1634035157|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1634035157, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1634035157, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1634035157, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1634035157} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1634035157, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1634035157, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1634035157, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1634035157|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1634035157} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 06:16:09,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L782-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~b$r_buff1_thd2~0_17) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_17, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:16:09,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L848-->L850-2: Formula: (and (or (= (mod v_~b$w_buff0_used~0_89 256) 0) (= 0 (mod v_~b$r_buff0_thd0~0_17 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_17} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_89, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_17} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:16:09,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L850-2-->L850-4: Formula: (let ((.cse1 (= (mod ~b$w_buff1_used~0_In2094255727 256) 0)) (.cse0 (= (mod ~b$r_buff1_thd0~0_In2094255727 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out2094255727| ~b$w_buff1~0_In2094255727) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite47_Out2094255727| ~b~0_In2094255727)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2094255727, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2094255727, ~b~0=~b~0_In2094255727, ~b$w_buff1~0=~b$w_buff1~0_In2094255727} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2094255727, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2094255727, ~b~0=~b~0_In2094255727, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out2094255727|, ~b$w_buff1~0=~b$w_buff1~0_In2094255727} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:16:09,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-4-->L851: Formula: (= v_~b~0_17 |v_ULTIMATE.start_main_#t~ite47_7|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_7|} OutVars{~b~0=v_~b~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 06:16:09,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1695845897 256))) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In-1695845897 256)))) (or (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-1695845897 |ULTIMATE.start_main_#t~ite49_Out-1695845897|)) (and (= |ULTIMATE.start_main_#t~ite49_Out-1695845897| 0) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1695845897, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1695845897} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1695845897, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-1695845897|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1695845897} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:16:09,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~b$w_buff0_used~0_In802065148 256))) (.cse3 (= (mod ~b$r_buff0_thd0~0_In802065148 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In802065148 256))) (.cse1 (= (mod ~b$r_buff1_thd0~0_In802065148 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out802065148|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= ~b$w_buff1_used~0_In802065148 |ULTIMATE.start_main_#t~ite50_Out802065148|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In802065148, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In802065148, ~b$w_buff1_used~0=~b$w_buff1_used~0_In802065148, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In802065148} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out802065148|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In802065148, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In802065148, ~b$w_buff1_used~0=~b$w_buff1_used~0_In802065148, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In802065148} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:16:09,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In2135668407 256) 0)) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In2135668407 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out2135668407| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out2135668407| ~b$r_buff0_thd0~0_In2135668407)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2135668407, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2135668407} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2135668407, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2135668407|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2135668407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:16:09,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L854-->L854-2: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In1014113760 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1014113760 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In1014113760 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd0~0_In1014113760 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~b$r_buff1_thd0~0_In1014113760 |ULTIMATE.start_main_#t~ite52_Out1014113760|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1014113760|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1014113760, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1014113760, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1014113760, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1014113760} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1014113760, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1014113760|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1014113760, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1014113760, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1014113760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:16:09,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_8) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~main$tmp_guard1~0_7 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~b$r_buff1_thd0~0_16 |v_ULTIMATE.start_main_#t~ite52_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~x~0_11 2) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:16:09,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:16:09 BasicIcfg [2019-12-27 06:16:09,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:16:09,610 INFO L168 Benchmark]: Toolchain (without parser) took 104274.16 ms. Allocated memory was 145.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 100.4 MB in the beginning and 976.2 MB in the end (delta: -875.9 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,610 INFO L168 Benchmark]: CDTParser took 0.43 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.00 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,612 INFO L168 Benchmark]: Boogie Preprocessor took 62.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,612 INFO L168 Benchmark]: RCFGBuilder took 1060.45 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 100.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,612 INFO L168 Benchmark]: TraceAbstraction took 102250.87 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 976.2 MB in the end (delta: -875.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 06:16:09,614 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.43 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.00 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 156.8 MB in the end (delta: -56.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.00 ms. Allocated memory is still 203.4 MB. Free memory was 156.2 MB in the beginning and 153.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.89 ms. Allocated memory is still 203.4 MB. Free memory was 153.6 MB in the beginning and 151.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1060.45 ms. Allocated memory is still 203.4 MB. Free memory was 151.6 MB in the beginning and 100.5 MB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 102250.87 ms. Allocated memory was 203.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.5 MB in the beginning and 976.2 MB in the end (delta: -875.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 179 ProgramPointsBefore, 93 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 32 ChoiceCompositions, 7196 VarBasedMoverChecksPositive, 207 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 81109 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t879, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t880, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 b$w_buff1 = b$w_buff0 [L738] 1 b$w_buff0 = 1 [L739] 1 b$w_buff1_used = b$w_buff0_used [L740] 1 b$w_buff0_used = (_Bool)1 [L752] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 x = 2 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L752] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L778] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L753] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L754] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L844] FCALL, FORK 0 pthread_create(&t881, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L802] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L803] 3 b$flush_delayed = weak$$choice2 [L804] 3 b$mem_tmp = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L805] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L805] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L806] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0))=1, x=2, y=1, z=1] [L806] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L807] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=2, y=1, z=1] [L807] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L808] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used))=0, x=2, y=1, z=1] [L808] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L809] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L817] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L817] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L818] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L819] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L820] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L779] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L780] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L781] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L851] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L852] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L853] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 101.9s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 29.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7881 SDtfs, 8998 SDslu, 24244 SDs, 0 SdLazy, 10115 SolverSat, 262 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 337 GetRequests, 48 SyntacticMatches, 35 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148375occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.8s AutomataMinimizationTime, 33 MinimizatonAttempts, 299835 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1349 NumberOfCodeBlocks, 1349 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 1249 ConstructedInterpolants, 0 QuantifiedInterpolants, 246075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...