/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/mix032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:13:53,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:13:53,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:13:53,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:13:53,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:13:53,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:13:53,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:13:53,061 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:13:53,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:13:53,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:13:53,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:13:53,070 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:13:53,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:13:53,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:13:53,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:13:53,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:13:53,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:13:53,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:13:53,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:13:53,086 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:13:53,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:13:53,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:13:53,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:13:53,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:13:53,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:13:53,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:13:53,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:13:53,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:13:53,102 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:13:53,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:13:53,103 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:13:53,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:13:53,104 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:13:53,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:13:53,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:13:53,107 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:13:53,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:13:53,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:13:53,108 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:13:53,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:13:53,110 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:13:53,111 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:13:53,139 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:13:53,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:13:53,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:13:53,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:13:53,141 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:13:53,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:13:53,142 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:13:53,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:13:53,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:13:53,142 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:13:53,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:13:53,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:13:53,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:13:53,143 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:13:53,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:13:53,144 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:13:53,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:13:53,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:13:53,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:13:53,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:13:53,145 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:13:53,145 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:13:53,145 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:13:53,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:13:53,145 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:13:53,146 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:13:53,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:13:53,146 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:13:53,146 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:13:53,146 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:13:53,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:13:53,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:13:53,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:13:53,439 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:13:53,440 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:13:53,440 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 06:13:53,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a6b1179/3ad082df6d7b43d38db4758d228adf9b/FLAGa8ed1210e [2019-12-27 06:13:54,102 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:13:54,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix032_rmo.oepc.i [2019-12-27 06:13:54,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a6b1179/3ad082df6d7b43d38db4758d228adf9b/FLAGa8ed1210e [2019-12-27 06:13:54,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51a6b1179/3ad082df6d7b43d38db4758d228adf9b [2019-12-27 06:13:54,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:13:54,331 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:13:54,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:54,335 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:13:54,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:13:54,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:54" (1/1) ... [2019-12-27 06:13:54,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77b036ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:54, skipping insertion in model container [2019-12-27 06:13:54,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:54" (1/1) ... [2019-12-27 06:13:54,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:13:54,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:13:54,973 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:54,988 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:13:55,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:13:55,170 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:13:55,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55 WrapperNode [2019-12-27 06:13:55,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:13:55,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:55,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:13:55,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:13:55,181 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:13:55" (1/1) ... [2019-12-27 06:13:55,209 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:13:55" (1/1) ... [2019-12-27 06:13:55,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:13:55,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:13:55,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:13:55,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:13:55,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (1/1) ... [2019-12-27 06:13:55,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:13:55,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:13:55,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:13:55,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:13:55,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (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:13:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:13:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:13:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:13:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:13:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:13:55,357 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:13:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:13:55,358 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:13:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 06:13:55,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 06:13:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:13:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:13:55,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:13:55,362 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:13:56,066 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:13:56,067 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:13:56,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:56 BoogieIcfgContainer [2019-12-27 06:13:56,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:13:56,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:13:56,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:13:56,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:13:56,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:54" (1/3) ... [2019-12-27 06:13:56,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6721703e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:56, skipping insertion in model container [2019-12-27 06:13:56,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:55" (2/3) ... [2019-12-27 06:13:56,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6721703e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:56, skipping insertion in model container [2019-12-27 06:13:56,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:56" (3/3) ... [2019-12-27 06:13:56,077 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_rmo.oepc.i [2019-12-27 06:13:56,088 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:13:56,088 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:13:56,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:13:56,100 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:13:56,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,172 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,174 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,176 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,178 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,179 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,181 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,199 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,199 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,239 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,246 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,247 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,248 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,249 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,250 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,254 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,255 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:13:56,272 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 06:13:56,294 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:13:56,294 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:13:56,295 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:13:56,295 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:13:56,295 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:13:56,295 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:13:56,295 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:13:56,295 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:13:56,312 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-27 06:13:56,314 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:56,415 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:56,415 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:56,432 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:56,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-27 06:13:56,519 INFO L132 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-27 06:13:56,519 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:13:56,530 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/165 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 06:13:56,562 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 06:13:56,564 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:13:59,370 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-27 06:14:00,177 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 06:14:00,307 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 06:14:00,335 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86141 [2019-12-27 06:14:00,335 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 06:14:00,339 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 107 transitions [2019-12-27 06:14:23,861 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 132752 states. [2019-12-27 06:14:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 132752 states. [2019-12-27 06:14:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:14:23,869 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:23,870 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:14:23,871 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:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:23,878 INFO L82 PathProgramCache]: Analyzing trace with hash 920980, now seen corresponding path program 1 times [2019-12-27 06:14:23,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:23,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597728273] [2019-12-27 06:14:23,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:24,208 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:24,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597728273] [2019-12-27 06:14:24,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:24,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:14:24,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693749834] [2019-12-27 06:14:24,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:14:24,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:24,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:14:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:14:24,236 INFO L87 Difference]: Start difference. First operand 132752 states. Second operand 3 states. [2019-12-27 06:14:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:25,973 INFO L93 Difference]: Finished difference Result 131526 states and 562532 transitions. [2019-12-27 06:14:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:14:25,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:14:25,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:30,307 INFO L225 Difference]: With dead ends: 131526 [2019-12-27 06:14:30,308 INFO L226 Difference]: Without dead ends: 123882 [2019-12-27 06:14:30,309 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:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123882 states. [2019-12-27 06:14:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123882 to 123882. [2019-12-27 06:14:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123882 states. [2019-12-27 06:14:44,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123882 states to 123882 states and 529184 transitions. [2019-12-27 06:14:44,065 INFO L78 Accepts]: Start accepts. Automaton has 123882 states and 529184 transitions. Word has length 3 [2019-12-27 06:14:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:14:44,066 INFO L462 AbstractCegarLoop]: Abstraction has 123882 states and 529184 transitions. [2019-12-27 06:14:44,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:14:44,066 INFO L276 IsEmpty]: Start isEmpty. Operand 123882 states and 529184 transitions. [2019-12-27 06:14:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:14:44,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:14:44,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:14:44,071 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:14:44,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:14:44,071 INFO L82 PathProgramCache]: Analyzing trace with hash 710493958, now seen corresponding path program 1 times [2019-12-27 06:14:44,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:14:44,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097416565] [2019-12-27 06:14:44,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:14:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:14:44,175 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:44,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097416565] [2019-12-27 06:14:44,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:14:44,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:14:44,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685889916] [2019-12-27 06:14:44,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:14:44,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:14:44,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:14:44,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:14:44,179 INFO L87 Difference]: Start difference. First operand 123882 states and 529184 transitions. Second operand 4 states. [2019-12-27 06:14:45,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:14:45,488 INFO L93 Difference]: Finished difference Result 192368 states and 789500 transitions. [2019-12-27 06:14:45,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:14:45,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:14:45,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:14:51,761 INFO L225 Difference]: With dead ends: 192368 [2019-12-27 06:14:51,761 INFO L226 Difference]: Without dead ends: 192319 [2019-12-27 06:14:51,762 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:14:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192319 states. [2019-12-27 06:15:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192319 to 176439. [2019-12-27 06:15:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176439 states. [2019-12-27 06:15:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176439 states to 176439 states and 733020 transitions. [2019-12-27 06:15:03,233 INFO L78 Accepts]: Start accepts. Automaton has 176439 states and 733020 transitions. Word has length 11 [2019-12-27 06:15:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:03,233 INFO L462 AbstractCegarLoop]: Abstraction has 176439 states and 733020 transitions. [2019-12-27 06:15:03,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 176439 states and 733020 transitions. [2019-12-27 06:15:03,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 06:15:03,243 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:03,243 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:03,243 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:03,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:03,244 INFO L82 PathProgramCache]: Analyzing trace with hash 379802942, now seen corresponding path program 1 times [2019-12-27 06:15:03,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:03,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842162171] [2019-12-27 06:15:03,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:03,304 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:03,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842162171] [2019-12-27 06:15:03,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:03,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:03,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822497541] [2019-12-27 06:15:03,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:03,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:03,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:03,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:03,307 INFO L87 Difference]: Start difference. First operand 176439 states and 733020 transitions. Second operand 3 states. [2019-12-27 06:15:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:03,449 INFO L93 Difference]: Finished difference Result 37131 states and 120949 transitions. [2019-12-27 06:15:03,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:03,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 06:15:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:03,535 INFO L225 Difference]: With dead ends: 37131 [2019-12-27 06:15:03,536 INFO L226 Difference]: Without dead ends: 37131 [2019-12-27 06:15:03,536 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:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37131 states. [2019-12-27 06:15:09,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37131 to 37131. [2019-12-27 06:15:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37131 states. [2019-12-27 06:15:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37131 states to 37131 states and 120949 transitions. [2019-12-27 06:15:10,008 INFO L78 Accepts]: Start accepts. Automaton has 37131 states and 120949 transitions. Word has length 13 [2019-12-27 06:15:10,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:10,008 INFO L462 AbstractCegarLoop]: Abstraction has 37131 states and 120949 transitions. [2019-12-27 06:15:10,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 37131 states and 120949 transitions. [2019-12-27 06:15:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:15:10,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:10,013 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:10,013 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:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:10,013 INFO L82 PathProgramCache]: Analyzing trace with hash 63930122, now seen corresponding path program 1 times [2019-12-27 06:15:10,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:10,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525243978] [2019-12-27 06:15:10,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:10,130 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:10,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525243978] [2019-12-27 06:15:10,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:10,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:10,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156579996] [2019-12-27 06:15:10,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:10,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:10,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:10,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:10,133 INFO L87 Difference]: Start difference. First operand 37131 states and 120949 transitions. Second operand 5 states. [2019-12-27 06:15:10,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:10,733 INFO L93 Difference]: Finished difference Result 51130 states and 164640 transitions. [2019-12-27 06:15:10,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:15:10,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 06:15:10,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:10,815 INFO L225 Difference]: With dead ends: 51130 [2019-12-27 06:15:10,815 INFO L226 Difference]: Without dead ends: 51130 [2019-12-27 06:15:10,815 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:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51130 states. [2019-12-27 06:15:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51130 to 43859. [2019-12-27 06:15:11,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43859 states. [2019-12-27 06:15:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43859 states to 43859 states and 142404 transitions. [2019-12-27 06:15:11,600 INFO L78 Accepts]: Start accepts. Automaton has 43859 states and 142404 transitions. Word has length 16 [2019-12-27 06:15:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:11,601 INFO L462 AbstractCegarLoop]: Abstraction has 43859 states and 142404 transitions. [2019-12-27 06:15:11,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43859 states and 142404 transitions. [2019-12-27 06:15:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 06:15:11,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:11,613 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:11,614 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:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1543064485, now seen corresponding path program 1 times [2019-12-27 06:15:11,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:11,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31436946] [2019-12-27 06:15:11,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:11,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:11,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31436946] [2019-12-27 06:15:11,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:11,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:11,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95282779] [2019-12-27 06:15:11,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:11,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:11,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:11,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:11,832 INFO L87 Difference]: Start difference. First operand 43859 states and 142404 transitions. Second operand 6 states. [2019-12-27 06:15:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:13,232 INFO L93 Difference]: Finished difference Result 65194 states and 206492 transitions. [2019-12-27 06:15:13,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 06:15:13,233 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-27 06:15:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:13,344 INFO L225 Difference]: With dead ends: 65194 [2019-12-27 06:15:13,344 INFO L226 Difference]: Without dead ends: 65187 [2019-12-27 06:15:13,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:13,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65187 states. [2019-12-27 06:15:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65187 to 43757. [2019-12-27 06:15:14,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43757 states. [2019-12-27 06:15:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43757 states to 43757 states and 141300 transitions. [2019-12-27 06:15:14,298 INFO L78 Accepts]: Start accepts. Automaton has 43757 states and 141300 transitions. Word has length 22 [2019-12-27 06:15:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:14,298 INFO L462 AbstractCegarLoop]: Abstraction has 43757 states and 141300 transitions. [2019-12-27 06:15:14,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43757 states and 141300 transitions. [2019-12-27 06:15:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:15:14,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:14,315 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:14,315 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:14,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash 970281241, now seen corresponding path program 1 times [2019-12-27 06:15:14,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:14,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108023305] [2019-12-27 06:15:14,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:14,410 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:14,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108023305] [2019-12-27 06:15:14,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:14,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:14,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634721261] [2019-12-27 06:15:14,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:14,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:14,412 INFO L87 Difference]: Start difference. First operand 43757 states and 141300 transitions. Second operand 4 states. [2019-12-27 06:15:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:14,481 INFO L93 Difference]: Finished difference Result 17328 states and 52920 transitions. [2019-12-27 06:15:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:14,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 06:15:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:14,508 INFO L225 Difference]: With dead ends: 17328 [2019-12-27 06:15:14,508 INFO L226 Difference]: Without dead ends: 17328 [2019-12-27 06:15:14,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17328 states. [2019-12-27 06:15:14,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17328 to 17035. [2019-12-27 06:15:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17035 states. [2019-12-27 06:15:14,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17035 states to 17035 states and 52084 transitions. [2019-12-27 06:15:14,782 INFO L78 Accepts]: Start accepts. Automaton has 17035 states and 52084 transitions. Word has length 25 [2019-12-27 06:15:14,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:14,783 INFO L462 AbstractCegarLoop]: Abstraction has 17035 states and 52084 transitions. [2019-12-27 06:15:14,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:14,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17035 states and 52084 transitions. [2019-12-27 06:15:14,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:14,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:14,795 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:14,795 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:14,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 847537641, now seen corresponding path program 1 times [2019-12-27 06:15:14,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:14,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040106156] [2019-12-27 06:15:14,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:14,849 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:14,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040106156] [2019-12-27 06:15:14,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:14,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:14,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085655568] [2019-12-27 06:15:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:14,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:14,854 INFO L87 Difference]: Start difference. First operand 17035 states and 52084 transitions. Second operand 3 states. [2019-12-27 06:15:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:14,954 INFO L93 Difference]: Finished difference Result 24679 states and 73906 transitions. [2019-12-27 06:15:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:14,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 06:15:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:14,988 INFO L225 Difference]: With dead ends: 24679 [2019-12-27 06:15:14,988 INFO L226 Difference]: Without dead ends: 24679 [2019-12-27 06:15:14,988 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:15,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24679 states. [2019-12-27 06:15:15,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24679 to 18893. [2019-12-27 06:15:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18893 states. [2019-12-27 06:15:15,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18893 states to 18893 states and 57180 transitions. [2019-12-27 06:15:15,320 INFO L78 Accepts]: Start accepts. Automaton has 18893 states and 57180 transitions. Word has length 27 [2019-12-27 06:15:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:15,320 INFO L462 AbstractCegarLoop]: Abstraction has 18893 states and 57180 transitions. [2019-12-27 06:15:15,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18893 states and 57180 transitions. [2019-12-27 06:15:15,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 06:15:15,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:15,537 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:15,537 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:15,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:15,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1249538234, now seen corresponding path program 1 times [2019-12-27 06:15:15,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:15,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867028089] [2019-12-27 06:15:15,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:15,719 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:15,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867028089] [2019-12-27 06:15:15,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:15,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:15,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682739564] [2019-12-27 06:15:15,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:15,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:15,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:15,722 INFO L87 Difference]: Start difference. First operand 18893 states and 57180 transitions. Second operand 8 states. [2019-12-27 06:15:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:16,640 INFO L93 Difference]: Finished difference Result 24657 states and 73330 transitions. [2019-12-27 06:15:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 06:15:16,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 06:15:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:16,676 INFO L225 Difference]: With dead ends: 24657 [2019-12-27 06:15:16,676 INFO L226 Difference]: Without dead ends: 24657 [2019-12-27 06:15:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:15:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24657 states. [2019-12-27 06:15:16,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24657 to 21635. [2019-12-27 06:15:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21635 states. [2019-12-27 06:15:17,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21635 states to 21635 states and 65084 transitions. [2019-12-27 06:15:17,034 INFO L78 Accepts]: Start accepts. Automaton has 21635 states and 65084 transitions. Word has length 27 [2019-12-27 06:15:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:17,035 INFO L462 AbstractCegarLoop]: Abstraction has 21635 states and 65084 transitions. [2019-12-27 06:15:17,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21635 states and 65084 transitions. [2019-12-27 06:15:17,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 06:15:17,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:17,065 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:17,065 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:17,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:17,065 INFO L82 PathProgramCache]: Analyzing trace with hash 303260619, now seen corresponding path program 1 times [2019-12-27 06:15:17,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:17,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70683789] [2019-12-27 06:15:17,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:17,182 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:17,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70683789] [2019-12-27 06:15:17,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:17,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 06:15:17,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547292433] [2019-12-27 06:15:17,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:17,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:17,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:17,184 INFO L87 Difference]: Start difference. First operand 21635 states and 65084 transitions. Second operand 7 states. [2019-12-27 06:15:18,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:18,558 INFO L93 Difference]: Finished difference Result 29098 states and 85533 transitions. [2019-12-27 06:15:18,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 06:15:18,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 06:15:18,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:18,609 INFO L225 Difference]: With dead ends: 29098 [2019-12-27 06:15:18,609 INFO L226 Difference]: Without dead ends: 29098 [2019-12-27 06:15:18,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-27 06:15:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29098 states. [2019-12-27 06:15:18,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29098 to 19796. [2019-12-27 06:15:18,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19796 states. [2019-12-27 06:15:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19796 states to 19796 states and 59787 transitions. [2019-12-27 06:15:18,952 INFO L78 Accepts]: Start accepts. Automaton has 19796 states and 59787 transitions. Word has length 33 [2019-12-27 06:15:18,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:18,952 INFO L462 AbstractCegarLoop]: Abstraction has 19796 states and 59787 transitions. [2019-12-27 06:15:18,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:18,952 INFO L276 IsEmpty]: Start isEmpty. Operand 19796 states and 59787 transitions. [2019-12-27 06:15:18,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 06:15:18,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:18,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:15:18,975 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:18,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1014539128, now seen corresponding path program 1 times [2019-12-27 06:15:18,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:18,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656351251] [2019-12-27 06:15:18,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:19,056 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:19,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656351251] [2019-12-27 06:15:19,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:19,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:15:19,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863324925] [2019-12-27 06:15:19,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:19,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:19,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:19,058 INFO L87 Difference]: Start difference. First operand 19796 states and 59787 transitions. Second operand 3 states. [2019-12-27 06:15:19,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:19,130 INFO L93 Difference]: Finished difference Result 19795 states and 59785 transitions. [2019-12-27 06:15:19,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:19,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 06:15:19,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:19,165 INFO L225 Difference]: With dead ends: 19795 [2019-12-27 06:15:19,165 INFO L226 Difference]: Without dead ends: 19795 [2019-12-27 06:15:19,166 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:19,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19795 states. [2019-12-27 06:15:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19795 to 19795. [2019-12-27 06:15:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19795 states. [2019-12-27 06:15:19,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19795 states to 19795 states and 59785 transitions. [2019-12-27 06:15:19,712 INFO L78 Accepts]: Start accepts. Automaton has 19795 states and 59785 transitions. Word has length 39 [2019-12-27 06:15:19,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:19,712 INFO L462 AbstractCegarLoop]: Abstraction has 19795 states and 59785 transitions. [2019-12-27 06:15:19,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 19795 states and 59785 transitions. [2019-12-27 06:15:19,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 06:15:19,733 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:19,733 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:19,733 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:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:19,734 INFO L82 PathProgramCache]: Analyzing trace with hash 756070649, now seen corresponding path program 1 times [2019-12-27 06:15:19,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:19,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632321439] [2019-12-27 06:15:19,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:19,827 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:19,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632321439] [2019-12-27 06:15:19,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:19,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:19,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676034467] [2019-12-27 06:15:19,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:19,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:19,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:19,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:19,829 INFO L87 Difference]: Start difference. First operand 19795 states and 59785 transitions. Second operand 3 states. [2019-12-27 06:15:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:19,904 INFO L93 Difference]: Finished difference Result 18780 states and 55919 transitions. [2019-12-27 06:15:19,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:19,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-27 06:15:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:19,935 INFO L225 Difference]: With dead ends: 18780 [2019-12-27 06:15:19,936 INFO L226 Difference]: Without dead ends: 18780 [2019-12-27 06:15:19,936 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:15:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18780 states. [2019-12-27 06:15:20,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18780 to 18772. [2019-12-27 06:15:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18772 states. [2019-12-27 06:15:20,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18772 states to 18772 states and 55903 transitions. [2019-12-27 06:15:20,238 INFO L78 Accepts]: Start accepts. Automaton has 18772 states and 55903 transitions. Word has length 40 [2019-12-27 06:15:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:20,239 INFO L462 AbstractCegarLoop]: Abstraction has 18772 states and 55903 transitions. [2019-12-27 06:15:20,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:20,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18772 states and 55903 transitions. [2019-12-27 06:15:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 06:15:20,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:20,258 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:20,258 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:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:20,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1150427388, now seen corresponding path program 1 times [2019-12-27 06:15:20,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:20,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065347683] [2019-12-27 06:15:20,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:20,321 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:20,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065347683] [2019-12-27 06:15:20,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:20,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:20,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482285323] [2019-12-27 06:15:20,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:20,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:20,323 INFO L87 Difference]: Start difference. First operand 18772 states and 55903 transitions. Second operand 5 states. [2019-12-27 06:15:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:20,411 INFO L93 Difference]: Finished difference Result 17448 states and 52890 transitions. [2019-12-27 06:15:20,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:15:20,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 06:15:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:20,440 INFO L225 Difference]: With dead ends: 17448 [2019-12-27 06:15:20,440 INFO L226 Difference]: Without dead ends: 17448 [2019-12-27 06:15:20,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17448 states. [2019-12-27 06:15:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17448 to 16867. [2019-12-27 06:15:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16867 states. [2019-12-27 06:15:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16867 states to 16867 states and 51321 transitions. [2019-12-27 06:15:20,920 INFO L78 Accepts]: Start accepts. Automaton has 16867 states and 51321 transitions. Word has length 41 [2019-12-27 06:15:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:20,920 INFO L462 AbstractCegarLoop]: Abstraction has 16867 states and 51321 transitions. [2019-12-27 06:15:20,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16867 states and 51321 transitions. [2019-12-27 06:15:20,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:20,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:20,951 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:20,951 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:20,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:20,951 INFO L82 PathProgramCache]: Analyzing trace with hash 739977269, now seen corresponding path program 1 times [2019-12-27 06:15:20,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:20,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333308117] [2019-12-27 06:15:20,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:21,008 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:21,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333308117] [2019-12-27 06:15:21,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:21,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:21,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806360685] [2019-12-27 06:15:21,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:21,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:21,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:21,010 INFO L87 Difference]: Start difference. First operand 16867 states and 51321 transitions. Second operand 3 states. [2019-12-27 06:15:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:21,128 INFO L93 Difference]: Finished difference Result 22403 states and 66828 transitions. [2019-12-27 06:15:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:21,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:21,167 INFO L225 Difference]: With dead ends: 22403 [2019-12-27 06:15:21,167 INFO L226 Difference]: Without dead ends: 22403 [2019-12-27 06:15:21,168 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:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22403 states. [2019-12-27 06:15:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22403 to 16412. [2019-12-27 06:15:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16412 states. [2019-12-27 06:15:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16412 states to 16412 states and 49355 transitions. [2019-12-27 06:15:21,513 INFO L78 Accepts]: Start accepts. Automaton has 16412 states and 49355 transitions. Word has length 65 [2019-12-27 06:15:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:21,514 INFO L462 AbstractCegarLoop]: Abstraction has 16412 states and 49355 transitions. [2019-12-27 06:15:21,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 16412 states and 49355 transitions. [2019-12-27 06:15:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:21,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:21,537 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:21,537 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:21,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:21,537 INFO L82 PathProgramCache]: Analyzing trace with hash -419133874, now seen corresponding path program 1 times [2019-12-27 06:15:21,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:21,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993896136] [2019-12-27 06:15:21,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:21,642 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:21,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993896136] [2019-12-27 06:15:21,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:21,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:21,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389461664] [2019-12-27 06:15:21,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:21,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:21,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:21,644 INFO L87 Difference]: Start difference. First operand 16412 states and 49355 transitions. Second operand 6 states. [2019-12-27 06:15:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:22,147 INFO L93 Difference]: Finished difference Result 18482 states and 55082 transitions. [2019-12-27 06:15:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:15:22,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 06:15:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:22,182 INFO L225 Difference]: With dead ends: 18482 [2019-12-27 06:15:22,183 INFO L226 Difference]: Without dead ends: 18482 [2019-12-27 06:15:22,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18482 states. [2019-12-27 06:15:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18482 to 17434. [2019-12-27 06:15:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17434 states. [2019-12-27 06:15:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17434 states to 17434 states and 52272 transitions. [2019-12-27 06:15:22,526 INFO L78 Accepts]: Start accepts. Automaton has 17434 states and 52272 transitions. Word has length 65 [2019-12-27 06:15:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:22,526 INFO L462 AbstractCegarLoop]: Abstraction has 17434 states and 52272 transitions. [2019-12-27 06:15:22,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 17434 states and 52272 transitions. [2019-12-27 06:15:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:22,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:22,551 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:22,551 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:22,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:22,552 INFO L82 PathProgramCache]: Analyzing trace with hash 658076300, now seen corresponding path program 2 times [2019-12-27 06:15:22,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:22,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702498497] [2019-12-27 06:15:22,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:22,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:22,665 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:22,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702498497] [2019-12-27 06:15:22,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:22,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:15:22,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582958434] [2019-12-27 06:15:22,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:15:22,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:15:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:22,667 INFO L87 Difference]: Start difference. First operand 17434 states and 52272 transitions. Second operand 6 states. [2019-12-27 06:15:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:23,511 INFO L93 Difference]: Finished difference Result 32536 states and 96210 transitions. [2019-12-27 06:15:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 06:15:23,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 06:15:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:23,567 INFO L225 Difference]: With dead ends: 32536 [2019-12-27 06:15:23,567 INFO L226 Difference]: Without dead ends: 32536 [2019-12-27 06:15:23,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 06:15:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32536 states. [2019-12-27 06:15:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32536 to 23879. [2019-12-27 06:15:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23879 states. [2019-12-27 06:15:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23879 states to 23879 states and 71627 transitions. [2019-12-27 06:15:24,013 INFO L78 Accepts]: Start accepts. Automaton has 23879 states and 71627 transitions. Word has length 65 [2019-12-27 06:15:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:24,013 INFO L462 AbstractCegarLoop]: Abstraction has 23879 states and 71627 transitions. [2019-12-27 06:15:24,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:15:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23879 states and 71627 transitions. [2019-12-27 06:15:24,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:24,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:24,036 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:24,036 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:24,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:24,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1850800222, now seen corresponding path program 3 times [2019-12-27 06:15:24,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:24,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248772190] [2019-12-27 06:15:24,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:24,173 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,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248772190] [2019-12-27 06:15:24,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:24,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:24,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995194735] [2019-12-27 06:15:24,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 06:15:24,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 06:15:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 06:15:24,176 INFO L87 Difference]: Start difference. First operand 23879 states and 71627 transitions. Second operand 8 states. [2019-12-27 06:15:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:25,384 INFO L93 Difference]: Finished difference Result 37155 states and 109178 transitions. [2019-12-27 06:15:25,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 06:15:25,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 06:15:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:25,434 INFO L225 Difference]: With dead ends: 37155 [2019-12-27 06:15:25,434 INFO L226 Difference]: Without dead ends: 37155 [2019-12-27 06:15:25,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 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:15:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37155 states. [2019-12-27 06:15:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37155 to 24170. [2019-12-27 06:15:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24170 states. [2019-12-27 06:15:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24170 states to 24170 states and 72427 transitions. [2019-12-27 06:15:25,944 INFO L78 Accepts]: Start accepts. Automaton has 24170 states and 72427 transitions. Word has length 65 [2019-12-27 06:15:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:25,944 INFO L462 AbstractCegarLoop]: Abstraction has 24170 states and 72427 transitions. [2019-12-27 06:15:25,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 06:15:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24170 states and 72427 transitions. [2019-12-27 06:15:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:25,970 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:25,970 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:25,970 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:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:25,971 INFO L82 PathProgramCache]: Analyzing trace with hash 2025516132, now seen corresponding path program 4 times [2019-12-27 06:15:25,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:25,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594932134] [2019-12-27 06:15:25,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:26,087 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:26,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594932134] [2019-12-27 06:15:26,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:26,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 06:15:26,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990265391] [2019-12-27 06:15:26,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:15:26,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:26,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:15:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:15:26,089 INFO L87 Difference]: Start difference. First operand 24170 states and 72427 transitions. Second operand 7 states. [2019-12-27 06:15:26,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:26,901 INFO L93 Difference]: Finished difference Result 38948 states and 114145 transitions. [2019-12-27 06:15:26,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:15:26,902 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 06:15:26,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:26,952 INFO L225 Difference]: With dead ends: 38948 [2019-12-27 06:15:26,952 INFO L226 Difference]: Without dead ends: 38948 [2019-12-27 06:15:26,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:15:27,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-27 06:15:27,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 24499. [2019-12-27 06:15:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24499 states. [2019-12-27 06:15:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24499 states to 24499 states and 73493 transitions. [2019-12-27 06:15:27,667 INFO L78 Accepts]: Start accepts. Automaton has 24499 states and 73493 transitions. Word has length 65 [2019-12-27 06:15:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:27,667 INFO L462 AbstractCegarLoop]: Abstraction has 24499 states and 73493 transitions. [2019-12-27 06:15:27,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:15:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 24499 states and 73493 transitions. [2019-12-27 06:15:27,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:27,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:27,693 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:27,693 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:27,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1785031174, now seen corresponding path program 5 times [2019-12-27 06:15:27,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:27,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037074488] [2019-12-27 06:15:27,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:27,971 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,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037074488] [2019-12-27 06:15:27,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:27,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 06:15:27,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155124793] [2019-12-27 06:15:27,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:15:27,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:15:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:27,973 INFO L87 Difference]: Start difference. First operand 24499 states and 73493 transitions. Second operand 13 states. [2019-12-27 06:15:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:31,672 INFO L93 Difference]: Finished difference Result 42396 states and 125475 transitions. [2019-12-27 06:15:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:15:31,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 06:15:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:31,728 INFO L225 Difference]: With dead ends: 42396 [2019-12-27 06:15:31,729 INFO L226 Difference]: Without dead ends: 42396 [2019-12-27 06:15:31,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:15:31,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42396 states. [2019-12-27 06:15:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42396 to 23926. [2019-12-27 06:15:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23926 states. [2019-12-27 06:15:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23926 states to 23926 states and 71357 transitions. [2019-12-27 06:15:32,221 INFO L78 Accepts]: Start accepts. Automaton has 23926 states and 71357 transitions. Word has length 65 [2019-12-27 06:15:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:32,222 INFO L462 AbstractCegarLoop]: Abstraction has 23926 states and 71357 transitions. [2019-12-27 06:15:32,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:15:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 23926 states and 71357 transitions. [2019-12-27 06:15:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 06:15:32,247 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:32,247 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:32,247 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:32,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:32,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1717838122, now seen corresponding path program 6 times [2019-12-27 06:15:32,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:32,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363000747] [2019-12-27 06:15:32,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:32,310 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,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363000747] [2019-12-27 06:15:32,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:32,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:15:32,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178466938] [2019-12-27 06:15:32,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:32,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:32,312 INFO L87 Difference]: Start difference. First operand 23926 states and 71357 transitions. Second operand 3 states. [2019-12-27 06:15:32,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:32,421 INFO L93 Difference]: Finished difference Result 23925 states and 71355 transitions. [2019-12-27 06:15:32,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:32,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 06:15:32,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:32,468 INFO L225 Difference]: With dead ends: 23925 [2019-12-27 06:15:32,468 INFO L226 Difference]: Without dead ends: 23925 [2019-12-27 06:15:32,469 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:15:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23925 states. [2019-12-27 06:15:33,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23925 to 19960. [2019-12-27 06:15:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19960 states. [2019-12-27 06:15:33,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19960 states to 19960 states and 60096 transitions. [2019-12-27 06:15:33,088 INFO L78 Accepts]: Start accepts. Automaton has 19960 states and 60096 transitions. Word has length 65 [2019-12-27 06:15:33,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:33,088 INFO L462 AbstractCegarLoop]: Abstraction has 19960 states and 60096 transitions. [2019-12-27 06:15:33,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 19960 states and 60096 transitions. [2019-12-27 06:15:33,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:33,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:33,109 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:15:33,109 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:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:33,109 INFO L82 PathProgramCache]: Analyzing trace with hash 793549301, now seen corresponding path program 1 times [2019-12-27 06:15:33,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:33,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627668436] [2019-12-27 06:15:33,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:33,561 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:33,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627668436] [2019-12-27 06:15:33,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:33,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 06:15:33,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534852720] [2019-12-27 06:15:33,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 06:15:33,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 06:15:33,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-27 06:15:33,563 INFO L87 Difference]: Start difference. First operand 19960 states and 60096 transitions. Second operand 17 states. [2019-12-27 06:15:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:43,424 INFO L93 Difference]: Finished difference Result 54976 states and 166574 transitions. [2019-12-27 06:15:43,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2019-12-27 06:15:43,425 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-27 06:15:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:43,482 INFO L225 Difference]: With dead ends: 54976 [2019-12-27 06:15:43,482 INFO L226 Difference]: Without dead ends: 43580 [2019-12-27 06:15:43,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7977 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2286, Invalid=18306, Unknown=0, NotChecked=0, Total=20592 [2019-12-27 06:15:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43580 states. [2019-12-27 06:15:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43580 to 27083. [2019-12-27 06:15:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27083 states. [2019-12-27 06:15:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27083 states to 27083 states and 82189 transitions. [2019-12-27 06:15:43,989 INFO L78 Accepts]: Start accepts. Automaton has 27083 states and 82189 transitions. Word has length 66 [2019-12-27 06:15:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:43,990 INFO L462 AbstractCegarLoop]: Abstraction has 27083 states and 82189 transitions. [2019-12-27 06:15:43,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 06:15:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27083 states and 82189 transitions. [2019-12-27 06:15:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 06:15:44,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:44,017 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:15:44,017 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:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:44,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1406465873, now seen corresponding path program 2 times [2019-12-27 06:15:44,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:44,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385191333] [2019-12-27 06:15:44,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:44,117 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:44,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385191333] [2019-12-27 06:15:44,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:44,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:44,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136604467] [2019-12-27 06:15:44,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:15:44,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:44,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:15:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:44,120 INFO L87 Difference]: Start difference. First operand 27083 states and 82189 transitions. Second operand 4 states. [2019-12-27 06:15:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:44,294 INFO L93 Difference]: Finished difference Result 30668 states and 93177 transitions. [2019-12-27 06:15:44,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:44,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 06:15:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:44,338 INFO L225 Difference]: With dead ends: 30668 [2019-12-27 06:15:44,338 INFO L226 Difference]: Without dead ends: 30668 [2019-12-27 06:15:44,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:15:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-27 06:15:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 24774. [2019-12-27 06:15:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24774 states. [2019-12-27 06:15:44,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24774 states to 24774 states and 75883 transitions. [2019-12-27 06:15:44,750 INFO L78 Accepts]: Start accepts. Automaton has 24774 states and 75883 transitions. Word has length 66 [2019-12-27 06:15:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:44,750 INFO L462 AbstractCegarLoop]: Abstraction has 24774 states and 75883 transitions. [2019-12-27 06:15:44,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:15:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 24774 states and 75883 transitions. [2019-12-27 06:15:44,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:44,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:44,776 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:15:44,776 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:44,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1863903971, now seen corresponding path program 1 times [2019-12-27 06:15:44,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:44,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835175223] [2019-12-27 06:15:44,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:44,963 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:44,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835175223] [2019-12-27 06:15:44,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:44,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:15:44,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004462637] [2019-12-27 06:15:44,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:15:44,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:44,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:15:44,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:44,966 INFO L87 Difference]: Start difference. First operand 24774 states and 75883 transitions. Second operand 10 states. [2019-12-27 06:15:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:46,789 INFO L93 Difference]: Finished difference Result 57616 states and 178120 transitions. [2019-12-27 06:15:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 06:15:46,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:15:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:46,879 INFO L225 Difference]: With dead ends: 57616 [2019-12-27 06:15:46,879 INFO L226 Difference]: Without dead ends: 57616 [2019-12-27 06:15:46,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:15:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57616 states. [2019-12-27 06:15:47,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57616 to 32331. [2019-12-27 06:15:47,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32331 states. [2019-12-27 06:15:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32331 states to 32331 states and 100369 transitions. [2019-12-27 06:15:47,839 INFO L78 Accepts]: Start accepts. Automaton has 32331 states and 100369 transitions. Word has length 67 [2019-12-27 06:15:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:47,839 INFO L462 AbstractCegarLoop]: Abstraction has 32331 states and 100369 transitions. [2019-12-27 06:15:47,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:15:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32331 states and 100369 transitions. [2019-12-27 06:15:47,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:47,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:47,876 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:15:47,876 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:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash 771290775, now seen corresponding path program 2 times [2019-12-27 06:15:47,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:47,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677241047] [2019-12-27 06:15:47,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:47,931 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,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677241047] [2019-12-27 06:15:47,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:47,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:15:47,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466048314] [2019-12-27 06:15:47,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:15:47,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:47,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:15:47,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:15:47,934 INFO L87 Difference]: Start difference. First operand 32331 states and 100369 transitions. Second operand 3 states. [2019-12-27 06:15:48,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:48,200 INFO L93 Difference]: Finished difference Result 47557 states and 148117 transitions. [2019-12-27 06:15:48,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:15:48,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 06:15:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:48,275 INFO L225 Difference]: With dead ends: 47557 [2019-12-27 06:15:48,275 INFO L226 Difference]: Without dead ends: 47557 [2019-12-27 06:15:48,275 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:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47557 states. [2019-12-27 06:15:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47557 to 29406. [2019-12-27 06:15:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29406 states. [2019-12-27 06:15:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29406 states to 29406 states and 91127 transitions. [2019-12-27 06:15:48,880 INFO L78 Accepts]: Start accepts. Automaton has 29406 states and 91127 transitions. Word has length 67 [2019-12-27 06:15:48,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:48,880 INFO L462 AbstractCegarLoop]: Abstraction has 29406 states and 91127 transitions. [2019-12-27 06:15:48,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:15:48,880 INFO L276 IsEmpty]: Start isEmpty. Operand 29406 states and 91127 transitions. [2019-12-27 06:15:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:48,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:48,915 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:15:48,915 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:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:48,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1099546952, now seen corresponding path program 1 times [2019-12-27 06:15:48,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:48,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968538408] [2019-12-27 06:15:48,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:49,104 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,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968538408] [2019-12-27 06:15:49,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:49,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 06:15:49,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474016523] [2019-12-27 06:15:49,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 06:15:49,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:49,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 06:15:49,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:15:49,106 INFO L87 Difference]: Start difference. First operand 29406 states and 91127 transitions. Second operand 10 states. [2019-12-27 06:15:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:50,776 INFO L93 Difference]: Finished difference Result 42354 states and 129410 transitions. [2019-12-27 06:15:50,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 06:15:50,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-27 06:15:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:50,827 INFO L225 Difference]: With dead ends: 42354 [2019-12-27 06:15:50,827 INFO L226 Difference]: Without dead ends: 33710 [2019-12-27 06:15:50,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2019-12-27 06:15:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33710 states. [2019-12-27 06:15:51,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33710 to 30017. [2019-12-27 06:15:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30017 states. [2019-12-27 06:15:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30017 states to 30017 states and 91754 transitions. [2019-12-27 06:15:51,588 INFO L78 Accepts]: Start accepts. Automaton has 30017 states and 91754 transitions. Word has length 67 [2019-12-27 06:15:51,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:51,589 INFO L462 AbstractCegarLoop]: Abstraction has 30017 states and 91754 transitions. [2019-12-27 06:15:51,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 06:15:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30017 states and 91754 transitions. [2019-12-27 06:15:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:51,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:51,621 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:15:51,621 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:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:51,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1428883769, now seen corresponding path program 3 times [2019-12-27 06:15:51,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:51,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386693196] [2019-12-27 06:15:51,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 06:15:51,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386693196] [2019-12-27 06:15:51,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:51,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:15:51,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142876574] [2019-12-27 06:15:51,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:15:51,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:15:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:15:51,720 INFO L87 Difference]: Start difference. First operand 30017 states and 91754 transitions. Second operand 5 states. [2019-12-27 06:15:51,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:51,904 INFO L93 Difference]: Finished difference Result 29616 states and 90307 transitions. [2019-12-27 06:15:51,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:15:51,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-27 06:15:51,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:51,970 INFO L225 Difference]: With dead ends: 29616 [2019-12-27 06:15:51,970 INFO L226 Difference]: Without dead ends: 29616 [2019-12-27 06:15:51,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:15:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29616 states. [2019-12-27 06:15:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29616 to 22753. [2019-12-27 06:15:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22753 states. [2019-12-27 06:15:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22753 states to 22753 states and 68514 transitions. [2019-12-27 06:15:52,676 INFO L78 Accepts]: Start accepts. Automaton has 22753 states and 68514 transitions. Word has length 67 [2019-12-27 06:15:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:52,677 INFO L462 AbstractCegarLoop]: Abstraction has 22753 states and 68514 transitions. [2019-12-27 06:15:52,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:15:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22753 states and 68514 transitions. [2019-12-27 06:15:52,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:52,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:52,712 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:15:52,712 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:52,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:52,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1575549788, now seen corresponding path program 2 times [2019-12-27 06:15:52,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:52,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581084858] [2019-12-27 06:15:52,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:52,937 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:52,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581084858] [2019-12-27 06:15:52,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:52,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 06:15:52,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657353940] [2019-12-27 06:15:52,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 06:15:52,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 06:15:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-27 06:15:52,939 INFO L87 Difference]: Start difference. First operand 22753 states and 68514 transitions. Second operand 12 states. [2019-12-27 06:15:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:54,287 INFO L93 Difference]: Finished difference Result 27106 states and 80823 transitions. [2019-12-27 06:15:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 06:15:54,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 06:15:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:54,322 INFO L225 Difference]: With dead ends: 27106 [2019-12-27 06:15:54,323 INFO L226 Difference]: Without dead ends: 26297 [2019-12-27 06:15:54,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2019-12-27 06:15:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26297 states. [2019-12-27 06:15:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26297 to 22813. [2019-12-27 06:15:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22813 states. [2019-12-27 06:15:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22813 states to 22813 states and 68651 transitions. [2019-12-27 06:15:54,680 INFO L78 Accepts]: Start accepts. Automaton has 22813 states and 68651 transitions. Word has length 67 [2019-12-27 06:15:54,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:54,681 INFO L462 AbstractCegarLoop]: Abstraction has 22813 states and 68651 transitions. [2019-12-27 06:15:54,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 06:15:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 22813 states and 68651 transitions. [2019-12-27 06:15:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:54,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:54,705 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:15:54,705 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:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1617390062, now seen corresponding path program 3 times [2019-12-27 06:15:54,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:54,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706437801] [2019-12-27 06:15:54,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:54,982 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:54,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706437801] [2019-12-27 06:15:54,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:54,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:15:54,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405698607] [2019-12-27 06:15:54,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:15:54,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:15:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:15:54,984 INFO L87 Difference]: Start difference. First operand 22813 states and 68651 transitions. Second operand 13 states. [2019-12-27 06:15:57,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:15:57,969 INFO L93 Difference]: Finished difference Result 28437 states and 84589 transitions. [2019-12-27 06:15:57,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 06:15:57,970 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 06:15:57,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:15:58,006 INFO L225 Difference]: With dead ends: 28437 [2019-12-27 06:15:58,006 INFO L226 Difference]: Without dead ends: 27725 [2019-12-27 06:15:58,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=871, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 06:15:58,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27725 states. [2019-12-27 06:15:58,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27725 to 23561. [2019-12-27 06:15:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23561 states. [2019-12-27 06:15:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23561 states to 23561 states and 70740 transitions. [2019-12-27 06:15:58,375 INFO L78 Accepts]: Start accepts. Automaton has 23561 states and 70740 transitions. Word has length 67 [2019-12-27 06:15:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:15:58,376 INFO L462 AbstractCegarLoop]: Abstraction has 23561 states and 70740 transitions. [2019-12-27 06:15:58,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:15:58,376 INFO L276 IsEmpty]: Start isEmpty. Operand 23561 states and 70740 transitions. [2019-12-27 06:15:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:15:58,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:15:58,403 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:15:58,403 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:15:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:15:58,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1584148550, now seen corresponding path program 4 times [2019-12-27 06:15:58,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:15:58,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384996911] [2019-12-27 06:15:58,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:15:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:15:58,708 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,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384996911] [2019-12-27 06:15:58,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:15:58,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:15:58,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597583346] [2019-12-27 06:15:58,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:15:58,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:15:58,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:15:58,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:15:58,710 INFO L87 Difference]: Start difference. First operand 23561 states and 70740 transitions. Second operand 11 states. [2019-12-27 06:16:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:00,042 INFO L93 Difference]: Finished difference Result 42533 states and 126541 transitions. [2019-12-27 06:16:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 06:16:00,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:16:00,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:00,096 INFO L225 Difference]: With dead ends: 42533 [2019-12-27 06:16:00,096 INFO L226 Difference]: Without dead ends: 40716 [2019-12-27 06:16:00,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=1006, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 06:16:00,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40716 states. [2019-12-27 06:16:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40716 to 24051. [2019-12-27 06:16:00,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24051 states. [2019-12-27 06:16:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24051 states to 24051 states and 72008 transitions. [2019-12-27 06:16:00,565 INFO L78 Accepts]: Start accepts. Automaton has 24051 states and 72008 transitions. Word has length 67 [2019-12-27 06:16:00,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:00,565 INFO L462 AbstractCegarLoop]: Abstraction has 24051 states and 72008 transitions. [2019-12-27 06:16:00,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:16:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 24051 states and 72008 transitions. [2019-12-27 06:16:00,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:00,586 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:00,586 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:00,586 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:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash 63464848, now seen corresponding path program 5 times [2019-12-27 06:16:00,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:00,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563789365] [2019-12-27 06:16:00,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:00,822 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:00,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563789365] [2019-12-27 06:16:00,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:00,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 06:16:00,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891031071] [2019-12-27 06:16:00,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 06:16:00,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 06:16:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 06:16:00,823 INFO L87 Difference]: Start difference. First operand 24051 states and 72008 transitions. Second operand 13 states. [2019-12-27 06:16:03,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:03,461 INFO L93 Difference]: Finished difference Result 30487 states and 90228 transitions. [2019-12-27 06:16:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 06:16:03,462 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 06:16:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:03,501 INFO L225 Difference]: With dead ends: 30487 [2019-12-27 06:16:03,501 INFO L226 Difference]: Without dead ends: 27746 [2019-12-27 06:16:03,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2019-12-27 06:16:03,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27746 states. [2019-12-27 06:16:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27746 to 23624. [2019-12-27 06:16:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23624 states. [2019-12-27 06:16:04,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23624 states to 23624 states and 70559 transitions. [2019-12-27 06:16:04,080 INFO L78 Accepts]: Start accepts. Automaton has 23624 states and 70559 transitions. Word has length 67 [2019-12-27 06:16:04,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:04,080 INFO L462 AbstractCegarLoop]: Abstraction has 23624 states and 70559 transitions. [2019-12-27 06:16:04,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 06:16:04,080 INFO L276 IsEmpty]: Start isEmpty. Operand 23624 states and 70559 transitions. [2019-12-27 06:16:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:04,102 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:04,102 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,102 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:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:04,102 INFO L82 PathProgramCache]: Analyzing trace with hash -912279478, now seen corresponding path program 6 times [2019-12-27 06:16:04,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:04,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187934041] [2019-12-27 06:16:04,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:16:04,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:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187934041] [2019-12-27 06:16:04,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:16:04,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 06:16:04,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087176681] [2019-12-27 06:16:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 06:16:04,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:16:04,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 06:16:04,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:16:04,343 INFO L87 Difference]: Start difference. First operand 23624 states and 70559 transitions. Second operand 11 states. [2019-12-27 06:16:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:16:05,536 INFO L93 Difference]: Finished difference Result 38249 states and 113856 transitions. [2019-12-27 06:16:05,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 06:16:05,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-27 06:16:05,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:16:05,580 INFO L225 Difference]: With dead ends: 38249 [2019-12-27 06:16:05,580 INFO L226 Difference]: Without dead ends: 30632 [2019-12-27 06:16:05,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2019-12-27 06:16:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30632 states. [2019-12-27 06:16:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30632 to 18419. [2019-12-27 06:16:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18419 states. [2019-12-27 06:16:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18419 states to 18419 states and 54967 transitions. [2019-12-27 06:16:05,933 INFO L78 Accepts]: Start accepts. Automaton has 18419 states and 54967 transitions. Word has length 67 [2019-12-27 06:16:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:16:05,933 INFO L462 AbstractCegarLoop]: Abstraction has 18419 states and 54967 transitions. [2019-12-27 06:16:05,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 06:16:05,933 INFO L276 IsEmpty]: Start isEmpty. Operand 18419 states and 54967 transitions. [2019-12-27 06:16:05,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 06:16:05,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:16:05,951 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:05,951 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:05,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:16:05,951 INFO L82 PathProgramCache]: Analyzing trace with hash 827602940, now seen corresponding path program 7 times [2019-12-27 06:16:05,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:16:05,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063913588] [2019-12-27 06:16:05,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:16:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:16:06,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:16:06,077 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:16:06,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [902] [902] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~main$tmp_guard1~0_16 0) (= v_~b$flush_delayed~0_13 0) (= v_~__unbuffered_p1_EBX~0_14 0) (= 0 v_~a~0_8) (= (select .cse0 |v_ULTIMATE.start_main_~#t861~0.base_21|) 0) (= v_~b$r_buff1_thd1~0_19 0) (= 0 v_~b$r_buff0_thd0~0_21) (= v_~b$r_buff1_thd2~0_18 0) (= 0 v_~b$read_delayed~0_7) (= |v_#valid_57| (store .cse0 |v_ULTIMATE.start_main_~#t861~0.base_21| 1)) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~y~0_7) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~b$r_buff0_thd1~0_29) (= v_~x~0_10 0) (= 0 v_~b$w_buff0~0_24) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_21| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t861~0.base_21|) |v_ULTIMATE.start_main_~#t861~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~z~0_7) (= v_~b$r_buff1_thd0~0_24 0) (= 0 v_~b$r_buff0_thd3~0_76) (= v_~b$read_delayed_var~0.offset_7 0) (= 0 v_~b$r_buff0_thd2~0_21) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 |v_ULTIMATE.start_main_~#t861~0.offset_17|) (= v_~__unbuffered_p2_EBX~0_15 0) (= v_~b$mem_tmp~0_10 0) (= v_~b$r_buff1_thd3~0_49 0) (= 0 v_~__unbuffered_p0_EAX~0_17) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t861~0.base_21|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t861~0.base_21| 4) |v_#length_25|) (= 0 v_~__unbuffered_p2_EAX~0_12) (= 0 v_~b$w_buff1_used~0_68) (= 0 v_~b$w_buff1~0_23) (= |v_#NULL.offset_4| 0) (= v_~b~0_28 0) (= 0 v_~b$w_buff0_used~0_110) (= 0 v_~b$read_delayed_var~0.base_7))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_76, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_19, ~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_13|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_11|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_110, ~a~0=v_~a~0_8, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ULTIMATE.start_main_~#t861~0.base=|v_ULTIMATE.start_main_~#t861~0.base_21|, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_21, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_21, ~b$mem_tmp~0=v_~b$mem_tmp~0_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_15, ~b$flush_delayed~0=v_~b$flush_delayed~0_13, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_23, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_13|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_68, ULTIMATE.start_main_~#t861~0.offset=|v_ULTIMATE.start_main_~#t861~0.offset_17|, ~y~0=v_~y~0_7, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_18, ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_14, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_17|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_21|, ~b~0=v_~b~0_28, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_7, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_49} 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, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t861~0.base, ~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, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t861~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t863~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t862~0.base, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_~#t863~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:16:06,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L754: Formula: (and (not (= P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-576821911 0)) (= ~b$r_buff0_thd2~0_In-576821911 ~b$r_buff1_thd2~0_Out-576821911) (= ~b$r_buff1_thd1~0_Out-576821911 ~b$r_buff0_thd1~0_In-576821911) (= ~b$r_buff1_thd3~0_Out-576821911 ~b$r_buff0_thd3~0_In-576821911) (= ~b$r_buff1_thd0~0_Out-576821911 ~b$r_buff0_thd0~0_In-576821911) (= 1 ~b$r_buff0_thd1~0_Out-576821911) (= ~x~0_In-576821911 ~__unbuffered_p0_EAX~0_Out-576821911)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-576821911, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-576821911, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-576821911, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-576821911, ~x~0=~x~0_In-576821911, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-576821911} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-576821911, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-576821911, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-576821911, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-576821911, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-576821911, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-576821911, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-576821911, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-576821911, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-576821911, ~x~0=~x~0_In-576821911, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-576821911} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-27 06:16:06,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L842-1-->L844: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t862~0.base_10|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t862~0.base_10| 4)) (= |v_ULTIMATE.start_main_~#t862~0.offset_9| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t862~0.base_10|) |v_ULTIMATE.start_main_~#t862~0.offset_9| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t862~0.base_10|)) (not (= |v_ULTIMATE.start_main_~#t862~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t862~0.offset=|v_ULTIMATE.start_main_~#t862~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t862~0.base=|v_ULTIMATE.start_main_~#t862~0.base_10|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t862~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t862~0.base, #length] because there is no mapped edge [2019-12-27 06:16:06,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In374405860 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In374405860 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite9_Out374405860| ~b$w_buff1~0_In374405860)) (and (or .cse0 .cse1) (= ~b~0_In374405860 |P1Thread1of1ForFork0_#t~ite9_Out374405860|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In374405860, ~b~0=~b~0_In374405860, ~b$w_buff1~0=~b$w_buff1~0_In374405860, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In374405860} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In374405860, ~b~0=~b~0_In374405860, ~b$w_buff1~0=~b$w_buff1~0_In374405860, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out374405860|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In374405860} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:16:06,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_23 |v_P1Thread1of1ForFork0_#t~ite9_8|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_8|} OutVars{~b~0=v_~b~0_23, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_7|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_7|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-27 06:16:06,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2131112532 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In2131112532 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out2131112532| ~b$w_buff0_used~0_In2131112532) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork0_#t~ite11_Out2131112532|) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2131112532, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2131112532} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2131112532, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In2131112532, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out2131112532|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 06:16:06,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In587232743 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd2~0_In587232743 256))) (.cse2 (= (mod ~b$r_buff0_thd2~0_In587232743 256) 0)) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In587232743 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite12_Out587232743|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In587232743 |P1Thread1of1ForFork0_#t~ite12_Out587232743|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In587232743, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In587232743, ~b$w_buff1_used~0=~b$w_buff1_used~0_In587232743, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In587232743} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In587232743, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In587232743, ~b$w_buff1_used~0=~b$w_buff1_used~0_In587232743, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out587232743|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In587232743} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 06:16:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1015163788 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd2~0_In1015163788 256) 0))) (or (and (= ~b$r_buff0_thd2~0_In1015163788 |P1Thread1of1ForFork0_#t~ite13_Out1015163788|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1015163788|) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1015163788, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1015163788} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1015163788, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1015163788, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1015163788|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 06:16:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd2~0_In862755262 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In862755262 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In862755262 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd2~0_In862755262 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite14_Out862755262| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~b$r_buff1_thd2~0_In862755262 |P1Thread1of1ForFork0_#t~ite14_Out862755262|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In862755262, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In862755262, ~b$w_buff1_used~0=~b$w_buff1_used~0_In862755262, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In862755262} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In862755262, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In862755262, ~b$w_buff1_used~0=~b$w_buff1_used~0_In862755262, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out862755262|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In862755262} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 06:16:06,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L784-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~b$r_buff1_thd2~0_13 |v_P1Thread1of1ForFork0_#t~ite14_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_8|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_7|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_13, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 06:16:06,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L844-1-->L846: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t863~0.base_13| 4)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t863~0.base_13|) |v_ULTIMATE.start_main_~#t863~0.offset_11| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t863~0.base_13|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t863~0.offset_11|) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t863~0.base_13| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t863~0.offset=|v_ULTIMATE.start_main_~#t863~0.offset_11|, ULTIMATE.start_main_~#t863~0.base=|v_ULTIMATE.start_main_~#t863~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t863~0.offset, ULTIMATE.start_main_~#t863~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 06:16:06,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L808-->L808-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In532435719 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite21_Out532435719| |P2Thread1of1ForFork1_#t~ite20_Out532435719|) (= |P2Thread1of1ForFork1_#t~ite20_Out532435719| ~b$w_buff0~0_In532435719) (let ((.cse0 (= (mod ~b$r_buff0_thd3~0_In532435719 256) 0))) (or (and (= (mod ~b$r_buff1_thd3~0_In532435719 256) 0) .cse0) (= (mod ~b$w_buff0_used~0_In532435719 256) 0) (and .cse0 (= (mod ~b$w_buff1_used~0_In532435719 256) 0)))) .cse1) (and (not .cse1) (= |P2Thread1of1ForFork1_#t~ite20_In532435719| |P2Thread1of1ForFork1_#t~ite20_Out532435719|) (= |P2Thread1of1ForFork1_#t~ite21_Out532435719| ~b$w_buff0~0_In532435719)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In532435719, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In532435719, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In532435719|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In532435719, ~b$w_buff0~0=~b$w_buff0~0_In532435719, ~weak$$choice2~0=~weak$$choice2~0_In532435719, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In532435719} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In532435719, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In532435719, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out532435719|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out532435719|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In532435719, ~b$w_buff0~0=~b$w_buff0~0_In532435719, ~weak$$choice2~0=~weak$$choice2~0_In532435719, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In532435719} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:16:06,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L810-->L810-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-849867830 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite26_In-849867830| |P2Thread1of1ForFork1_#t~ite26_Out-849867830|) (= ~b$w_buff0_used~0_In-849867830 |P2Thread1of1ForFork1_#t~ite27_Out-849867830|)) (and (= ~b$w_buff0_used~0_In-849867830 |P2Thread1of1ForFork1_#t~ite26_Out-849867830|) (= |P2Thread1of1ForFork1_#t~ite26_Out-849867830| |P2Thread1of1ForFork1_#t~ite27_Out-849867830|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In-849867830 256)))) (or (= (mod ~b$w_buff0_used~0_In-849867830 256) 0) (and .cse1 (= (mod ~b$w_buff1_used~0_In-849867830 256) 0)) (and (= (mod ~b$r_buff1_thd3~0_In-849867830 256) 0) .cse1))) .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-849867830, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-849867830, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-849867830|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-849867830, ~weak$$choice2~0=~weak$$choice2~0_In-849867830, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-849867830} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-849867830, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-849867830|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-849867830, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-849867830|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-849867830, ~weak$$choice2~0=~weak$$choice2~0_In-849867830, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-849867830} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-27 06:16:06,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (= v_~b$r_buff0_thd3~0_49 v_~b$r_buff0_thd3~0_50) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_49, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_8|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:16:06,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (= v_~b~0_18 v_~b$mem_tmp~0_5) (not (= (mod v_~b$flush_delayed~0_8 256) 0))) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, ~b~0=v_~b~0_18, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-27 06:16:06,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In215130025 256))) (.cse1 (= (mod ~b$r_buff1_thd3~0_In215130025 256) 0))) (or (and (or .cse0 .cse1) (= ~b~0_In215130025 |P2Thread1of1ForFork1_#t~ite38_Out215130025|)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite38_Out215130025| ~b$w_buff1~0_In215130025) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In215130025, ~b~0=~b~0_In215130025, ~b$w_buff1~0=~b$w_buff1~0_In215130025, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In215130025} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out215130025|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In215130025, ~b~0=~b~0_In215130025, ~b$w_buff1~0=~b$w_buff1~0_In215130025, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In215130025} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-27 06:16:06,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_20 |v_P2Thread1of1ForFork1_#t~ite38_8|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_8|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_7|, ~b~0=v_~b~0_20, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-27 06:16:06,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-619991536 256))) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-619991536 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite40_Out-619991536|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-619991536 |P2Thread1of1ForFork1_#t~ite40_Out-619991536|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-619991536, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-619991536} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-619991536, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-619991536, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out-619991536|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-27 06:16:06,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1484633834 256))) (.cse1 (= (mod ~b$w_buff1_used~0_In1484633834 256) 0)) (.cse2 (= 0 (mod ~b$r_buff0_thd3~0_In1484633834 256))) (.cse3 (= (mod ~b$w_buff0_used~0_In1484633834 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite41_Out1484633834|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~b$w_buff1_used~0_In1484633834 |P2Thread1of1ForFork1_#t~ite41_Out1484633834|) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1484633834, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1484633834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1484633834, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1484633834} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1484633834, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1484633834, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1484633834, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out1484633834|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1484633834} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-27 06:16:06,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In1035401326 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd3~0_In1035401326 256) 0))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out1035401326|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd3~0_In1035401326 |P2Thread1of1ForFork1_#t~ite42_Out1035401326|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1035401326, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1035401326} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1035401326, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1035401326, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out1035401326|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-27 06:16:06,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In-555665656 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-555665656 256))) (.cse2 (= (mod ~b$w_buff0_used~0_In-555665656 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd3~0_In-555665656 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite43_Out-555665656| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite43_Out-555665656| ~b$r_buff1_thd3~0_In-555665656) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-555665656, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-555665656, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-555665656, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-555665656} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-555665656, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-555665656, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out-555665656|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-555665656, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-555665656} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 06:16:06,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L823-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~b$r_buff1_thd3~0_42 |v_P2Thread1of1ForFork1_#t~ite43_8|)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_42, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 06:16:06,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-202755192 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-202755192 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out-202755192|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-202755192 |P0Thread1of1ForFork2_#t~ite5_Out-202755192|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-202755192, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-202755192} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-202755192, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-202755192, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out-202755192|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 06:16:06,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In-1697733187 256))) (.cse0 (= (mod ~b$w_buff0_used~0_In-1697733187 256) 0)) (.cse2 (= 0 (mod ~b$r_buff1_thd1~0_In-1697733187 256))) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1697733187 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1697733187| ~b$w_buff1_used~0_In-1697733187) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out-1697733187|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1697733187, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1697733187, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1697733187, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1697733187} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1697733187, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1697733187, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1697733187, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1697733187, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1697733187|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 06:16:06,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In2143124214 256))) (.cse1 (= (mod ~b$r_buff0_thd1~0_In2143124214 256) 0))) (or (and (not .cse0) (= ~b$r_buff0_thd1~0_Out2143124214 0) (not .cse1)) (and (= ~b$r_buff0_thd1~0_In2143124214 ~b$r_buff0_thd1~0_Out2143124214) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2143124214, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2143124214} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2143124214, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out2143124214, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out2143124214|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 06:16:06,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In1968870246 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1968870246 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd1~0_In1968870246 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In1968870246 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_Out1968870246| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P0Thread1of1ForFork2_#t~ite8_Out1968870246| ~b$r_buff1_thd1~0_In1968870246)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1968870246, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1968870246, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1968870246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1968870246} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1968870246, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1968870246, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1968870246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1968870246, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1968870246|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 06:16:06,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= v_~b$r_buff1_thd1~0_15 |v_P0Thread1of1ForFork2_#t~ite8_8|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_15, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_7|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 06:16:06,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 06:16:06,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In-423132674 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-423132674 256)))) (or (and (= ~b$w_buff1~0_In-423132674 |ULTIMATE.start_main_#t~ite47_Out-423132674|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b~0_In-423132674 |ULTIMATE.start_main_#t~ite47_Out-423132674|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-423132674, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-423132674, ~b~0=~b~0_In-423132674, ~b$w_buff1~0=~b$w_buff1~0_In-423132674} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-423132674, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-423132674, ~b~0=~b~0_In-423132674, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-423132674|, ~b$w_buff1~0=~b$w_buff1~0_In-423132674} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 06:16:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_21 |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_21, 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:06,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd0~0_In-2139685312 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-2139685312 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-2139685312|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-2139685312 |ULTIMATE.start_main_#t~ite49_Out-2139685312|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2139685312, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2139685312} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2139685312, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2139685312|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2139685312} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 06:16:06,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In859145994 256))) (.cse1 (= (mod ~b$r_buff0_thd0~0_In859145994 256) 0)) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In859145994 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In859145994 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out859145994| 0)) (and (= ~b$w_buff1_used~0_In859145994 |ULTIMATE.start_main_#t~ite50_Out859145994|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In859145994, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In859145994, ~b$w_buff1_used~0=~b$w_buff1_used~0_In859145994, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In859145994} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out859145994|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In859145994, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In859145994, ~b$w_buff1_used~0=~b$w_buff1_used~0_In859145994, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In859145994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 06:16:06,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In2112937129 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In2112937129 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite51_Out2112937129| ~b$r_buff0_thd0~0_In2112937129)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out2112937129|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2112937129, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2112937129} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2112937129, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2112937129|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2112937129} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 06:16:06,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd0~0_In-286045238 256) 0)) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In-286045238 256))) (.cse3 (= (mod ~b$r_buff0_thd0~0_In-286045238 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-286045238 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-286045238|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~b$r_buff1_thd0~0_In-286045238 |ULTIMATE.start_main_#t~ite52_Out-286045238|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-286045238, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-286045238, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-286045238, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-286045238} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-286045238, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-286045238|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-286045238, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-286045238, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-286045238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 06:16:06,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~__unbuffered_p2_EAX~0_5 1) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p2_EBX~0_9 0) (= v_~main$tmp_guard1~0_8 0) (= v_~b$r_buff1_thd0~0_17 |v_ULTIMATE.start_main_#t~ite52_11|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= 0 v_~__unbuffered_p1_EBX~0_7)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_11|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_10|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_5, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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:06,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:16:06 BasicIcfg [2019-12-27 06:16:06,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:16:06,233 INFO L168 Benchmark]: Toolchain (without parser) took 131902.14 ms. Allocated memory was 147.3 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 103.6 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,233 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.34 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.2 MB in the beginning and 157.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,235 INFO L168 Benchmark]: Boogie Preprocessor took 39.48 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,235 INFO L168 Benchmark]: RCFGBuilder took 788.08 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,237 INFO L168 Benchmark]: TraceAbstraction took 130160.02 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 06:16:06,239 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.19 ms. Allocated memory is still 147.3 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.34 ms. Allocated memory was 147.3 MB in the beginning and 204.5 MB in the end (delta: 57.1 MB). Free memory was 103.2 MB in the beginning and 157.7 MB in the end (delta: -54.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.48 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 152.6 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 788.08 ms. Allocated memory is still 204.5 MB. Free memory was 152.6 MB in the beginning and 102.0 MB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 130160.02 ms. Allocated memory was 204.5 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.3 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 180 ProgramPointsBefore, 97 ProgramPointsAfterwards, 217 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7585 VarBasedMoverChecksPositive, 220 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 86141 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t861, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] 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_p0_EAX=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=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=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t862, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=1, z=0] [L780] 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_p0_EAX=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=1, y=1, z=0] [L754] 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) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 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 [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] FCALL, FORK 0 pthread_create(&t863, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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}, 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=1, z=0] [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 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) [L808] 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)) [L809] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, 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=1, y=1, z=1] [L809] 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)) [L810] 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)) [L811] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, 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_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))=0, x=1, y=1, z=1] [L811] 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)) [L813] EXPR 3 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, 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$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))=0, x=1, y=1, z=1] [L813] 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)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __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=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 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 [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 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 [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __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=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 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 [L855] 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, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 129.7s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 50.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7707 SDtfs, 9538 SDslu, 32842 SDs, 0 SdLazy, 23572 SolverSat, 484 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 51 SyntacticMatches, 23 SemanticMatches, 458 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176439occurred 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: 45.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 246169 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1457 ConstructedInterpolants, 0 QuantifiedInterpolants, 476800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...