/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/mix043_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:25:35,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:25:35,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:25:35,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:25:35,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:25:35,034 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:25:35,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:25:35,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:25:35,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:25:35,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:25:35,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:25:35,053 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:25:35,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:25:35,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:25:35,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:25:35,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:25:35,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:25:35,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:25:35,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:25:35,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:25:35,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:25:35,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:25:35,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:25:35,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:25:35,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:25:35,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:25:35,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:25:35,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:25:35,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:25:35,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:25:35,076 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:25:35,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:25:35,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:25:35,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:25:35,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:25:35,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:25:35,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:25:35,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:25:35,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:25:35,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:25:35,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:25:35,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:25:35,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:25:35,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:25:35,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:25:35,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:25:35,099 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:25:35,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:25:35,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:25:35,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:25:35,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:25:35,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:25:35,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:25:35,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:25:35,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:25:35,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:25:35,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:25:35,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:25:35,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:25:35,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:25:35,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:25:35,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:25:35,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:25:35,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:25:35,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:25:35,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:25:35,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:25:35,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:25:35,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:25:35,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:25:35,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:25:35,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:25:35,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:25:35,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:25:35,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:25:35,437 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:25:35,438 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:25:35,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-18 21:25:35,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118d18213/1a14501784dc4ce49a234660e58c4de9/FLAG4c7ba1cba [2019-12-18 21:25:36,136 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:25:36,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_pso.opt.i [2019-12-18 21:25:36,151 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118d18213/1a14501784dc4ce49a234660e58c4de9/FLAG4c7ba1cba [2019-12-18 21:25:36,416 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/118d18213/1a14501784dc4ce49a234660e58c4de9 [2019-12-18 21:25:36,425 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:25:36,427 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:25:36,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:25:36,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:25:36,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:25:36,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:36" (1/1) ... [2019-12-18 21:25:36,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30191dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:36, skipping insertion in model container [2019-12-18 21:25:36,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:25:36" (1/1) ... [2019-12-18 21:25:36,444 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:25:36,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:25:37,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:25:37,053 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:25:37,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:25:37,224 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:25:37,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37 WrapperNode [2019-12-18 21:25:37,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:25:37,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:25:37,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:25:37,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:25:37,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:25:37,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:25:37,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:25:37,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:25:37,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... [2019-12-18 21:25:37,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:25:37,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:25:37,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:25:37,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:25:37,349 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:25:37,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:25:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:25:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:25:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:25:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:25:37,409 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:25:37,409 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:25:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:25:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:25:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:25:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:25:37,410 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:25:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:25:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:25:37,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:25:37,413 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:25:38,166 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:25:38,167 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:25:38,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:38 BoogieIcfgContainer [2019-12-18 21:25:38,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:25:38,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:25:38,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:25:38,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:25:38,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:25:36" (1/3) ... [2019-12-18 21:25:38,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e56414b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:38, skipping insertion in model container [2019-12-18 21:25:38,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:25:37" (2/3) ... [2019-12-18 21:25:38,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e56414b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:25:38, skipping insertion in model container [2019-12-18 21:25:38,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:25:38" (3/3) ... [2019-12-18 21:25:38,180 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_pso.opt.i [2019-12-18 21:25:38,188 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:25:38,189 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:25:38,196 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:25:38,196 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:25:38,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,238 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,239 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,239 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,240 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,240 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,241 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,242 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,243 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,244 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,245 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,246 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,247 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,264 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,264 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,264 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,265 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,265 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,266 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,266 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,266 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,266 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,267 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,267 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,267 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,267 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,268 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,269 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,270 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,271 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,272 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,279 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,280 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,283 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,286 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,286 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,287 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,288 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,288 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,289 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:25:38,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:25:38,325 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:25:38,325 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:25:38,325 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:25:38,326 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:25:38,326 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:25:38,326 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:25:38,326 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:25:38,326 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:25:38,342 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-18 21:25:38,344 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:25:38,438 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:25:38,438 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:25:38,454 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:25:38,478 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-18 21:25:38,525 INFO L126 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-18 21:25:38,525 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:25:38,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 21:25:38,550 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-18 21:25:38,552 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:25:42,152 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-18 21:25:42,321 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-18 21:25:42,346 INFO L206 etLargeBlockEncoding]: Checked pairs total: 57720 [2019-12-18 21:25:42,346 INFO L214 etLargeBlockEncoding]: Total number of compositions: 124 [2019-12-18 21:25:42,350 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 98 transitions [2019-12-18 21:25:45,240 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34622 states. [2019-12-18 21:25:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 34622 states. [2019-12-18 21:25:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:25:45,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:45,250 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:45,250 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:45,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:45,255 INFO L82 PathProgramCache]: Analyzing trace with hash 86209296, now seen corresponding path program 1 times [2019-12-18 21:25:45,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:45,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926813054] [2019-12-18 21:25:45,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:45,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926813054] [2019-12-18 21:25:45,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:45,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:25:45,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295183867] [2019-12-18 21:25:45,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:25:45,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:25:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:45,557 INFO L87 Difference]: Start difference. First operand 34622 states. Second operand 3 states. [2019-12-18 21:25:46,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:46,229 INFO L93 Difference]: Finished difference Result 34422 states and 146848 transitions. [2019-12-18 21:25:46,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:25:46,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:25:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:46,727 INFO L225 Difference]: With dead ends: 34422 [2019-12-18 21:25:46,727 INFO L226 Difference]: Without dead ends: 33750 [2019-12-18 21:25:46,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:25:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33750 states. [2019-12-18 21:25:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33750 to 33750. [2019-12-18 21:25:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33750 states. [2019-12-18 21:25:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33750 states to 33750 states and 144104 transitions. [2019-12-18 21:25:50,295 INFO L78 Accepts]: Start accepts. Automaton has 33750 states and 144104 transitions. Word has length 9 [2019-12-18 21:25:50,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:50,296 INFO L462 AbstractCegarLoop]: Abstraction has 33750 states and 144104 transitions. [2019-12-18 21:25:50,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:25:50,298 INFO L276 IsEmpty]: Start isEmpty. Operand 33750 states and 144104 transitions. [2019-12-18 21:25:50,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:25:50,310 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:50,310 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:50,311 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:50,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:50,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2020718279, now seen corresponding path program 1 times [2019-12-18 21:25:50,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:50,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932399504] [2019-12-18 21:25:50,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:50,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:50,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932399504] [2019-12-18 21:25:50,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:50,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:50,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144737103] [2019-12-18 21:25:50,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:50,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:50,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:50,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:50,460 INFO L87 Difference]: Start difference. First operand 33750 states and 144104 transitions. Second operand 4 states. [2019-12-18 21:25:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:51,011 INFO L93 Difference]: Finished difference Result 52526 states and 216740 transitions. [2019-12-18 21:25:51,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:51,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:25:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:51,401 INFO L225 Difference]: With dead ends: 52526 [2019-12-18 21:25:51,401 INFO L226 Difference]: Without dead ends: 52498 [2019-12-18 21:25:51,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:52,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52498 states. [2019-12-18 21:25:53,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52498 to 47958. [2019-12-18 21:25:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47958 states. [2019-12-18 21:25:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47958 states to 47958 states and 199860 transitions. [2019-12-18 21:25:53,711 INFO L78 Accepts]: Start accepts. Automaton has 47958 states and 199860 transitions. Word has length 15 [2019-12-18 21:25:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:53,711 INFO L462 AbstractCegarLoop]: Abstraction has 47958 states and 199860 transitions. [2019-12-18 21:25:53,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47958 states and 199860 transitions. [2019-12-18 21:25:53,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:25:53,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:53,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:25:53,715 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:53,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:53,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1977980563, now seen corresponding path program 1 times [2019-12-18 21:25:53,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:53,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500185760] [2019-12-18 21:25:53,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:53,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500185760] [2019-12-18 21:25:53,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:53,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:25:53,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313884220] [2019-12-18 21:25:53,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:25:53,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:53,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:25:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:25:53,847 INFO L87 Difference]: Start difference. First operand 47958 states and 199860 transitions. Second operand 4 states. [2019-12-18 21:25:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:56,067 INFO L93 Difference]: Finished difference Result 59070 states and 244072 transitions. [2019-12-18 21:25:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:25:56,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:25:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:56,249 INFO L225 Difference]: With dead ends: 59070 [2019-12-18 21:25:56,249 INFO L226 Difference]: Without dead ends: 59070 [2019-12-18 21:25:56,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59070 states. [2019-12-18 21:25:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59070 to 53006. [2019-12-18 21:25:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53006 states. [2019-12-18 21:25:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53006 states to 53006 states and 220392 transitions. [2019-12-18 21:25:58,546 INFO L78 Accepts]: Start accepts. Automaton has 53006 states and 220392 transitions. Word has length 15 [2019-12-18 21:25:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:58,547 INFO L462 AbstractCegarLoop]: Abstraction has 53006 states and 220392 transitions. [2019-12-18 21:25:58,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:25:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 53006 states and 220392 transitions. [2019-12-18 21:25:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 21:25:58,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:58,560 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] [2019-12-18 21:25:58,560 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:58,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:58,560 INFO L82 PathProgramCache]: Analyzing trace with hash -587282460, now seen corresponding path program 1 times [2019-12-18 21:25:58,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:58,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247864633] [2019-12-18 21:25:58,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:25:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:25:58,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247864633] [2019-12-18 21:25:58,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:25:58,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:25:58,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946122190] [2019-12-18 21:25:58,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:25:58,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:25:58,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:25:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:25:58,689 INFO L87 Difference]: Start difference. First operand 53006 states and 220392 transitions. Second operand 5 states. [2019-12-18 21:25:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:59,470 INFO L93 Difference]: Finished difference Result 70534 states and 288484 transitions. [2019-12-18 21:25:59,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:25:59,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-18 21:25:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:59,671 INFO L225 Difference]: With dead ends: 70534 [2019-12-18 21:25:59,672 INFO L226 Difference]: Without dead ends: 70506 [2019-12-18 21:25:59,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:02,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70506 states. [2019-12-18 21:26:03,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70506 to 52682. [2019-12-18 21:26:03,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52682 states. [2019-12-18 21:26:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52682 states to 52682 states and 218712 transitions. [2019-12-18 21:26:03,805 INFO L78 Accepts]: Start accepts. Automaton has 52682 states and 218712 transitions. Word has length 21 [2019-12-18 21:26:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:03,805 INFO L462 AbstractCegarLoop]: Abstraction has 52682 states and 218712 transitions. [2019-12-18 21:26:03,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:26:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 52682 states and 218712 transitions. [2019-12-18 21:26:03,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:26:03,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:03,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:03,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:03,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:03,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1693897678, now seen corresponding path program 1 times [2019-12-18 21:26:03,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:03,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476759951] [2019-12-18 21:26:03,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:03,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476759951] [2019-12-18 21:26:03,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:03,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:03,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904086731] [2019-12-18 21:26:03,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:03,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:03,903 INFO L87 Difference]: Start difference. First operand 52682 states and 218712 transitions. Second operand 3 states. [2019-12-18 21:26:04,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:04,245 INFO L93 Difference]: Finished difference Result 65362 states and 268648 transitions. [2019-12-18 21:26:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:04,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 21:26:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:04,453 INFO L225 Difference]: With dead ends: 65362 [2019-12-18 21:26:04,453 INFO L226 Difference]: Without dead ends: 65362 [2019-12-18 21:26:04,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65362 states. [2019-12-18 21:26:06,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65362 to 57878. [2019-12-18 21:26:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57878 states. [2019-12-18 21:26:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57878 states to 57878 states and 239624 transitions. [2019-12-18 21:26:09,886 INFO L78 Accepts]: Start accepts. Automaton has 57878 states and 239624 transitions. Word has length 29 [2019-12-18 21:26:09,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:09,886 INFO L462 AbstractCegarLoop]: Abstraction has 57878 states and 239624 transitions. [2019-12-18 21:26:09,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57878 states and 239624 transitions. [2019-12-18 21:26:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:26:09,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:09,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:09,921 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:09,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:09,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1910359084, now seen corresponding path program 1 times [2019-12-18 21:26:09,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:09,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322352454] [2019-12-18 21:26:09,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:10,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322352454] [2019-12-18 21:26:10,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:10,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:26:10,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358023380] [2019-12-18 21:26:10,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:26:10,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:10,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:26:10,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:26:10,012 INFO L87 Difference]: Start difference. First operand 57878 states and 239624 transitions. Second operand 6 states. [2019-12-18 21:26:10,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:10,737 INFO L93 Difference]: Finished difference Result 82714 states and 336740 transitions. [2019-12-18 21:26:10,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:26:10,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:26:10,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:10,950 INFO L225 Difference]: With dead ends: 82714 [2019-12-18 21:26:10,950 INFO L226 Difference]: Without dead ends: 82650 [2019-12-18 21:26:10,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:11,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82650 states. [2019-12-18 21:26:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82650 to 66690. [2019-12-18 21:26:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66690 states. [2019-12-18 21:26:12,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66690 states to 66690 states and 274804 transitions. [2019-12-18 21:26:12,807 INFO L78 Accepts]: Start accepts. Automaton has 66690 states and 274804 transitions. Word has length 29 [2019-12-18 21:26:12,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:12,807 INFO L462 AbstractCegarLoop]: Abstraction has 66690 states and 274804 transitions. [2019-12-18 21:26:12,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:26:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 66690 states and 274804 transitions. [2019-12-18 21:26:12,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:26:12,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:12,880 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] [2019-12-18 21:26:12,880 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:12,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1476951563, now seen corresponding path program 1 times [2019-12-18 21:26:12,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:12,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924059823] [2019-12-18 21:26:12,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:13,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924059823] [2019-12-18 21:26:13,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:13,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:26:13,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779330107] [2019-12-18 21:26:13,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:13,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:13,003 INFO L87 Difference]: Start difference. First operand 66690 states and 274804 transitions. Second operand 7 states. [2019-12-18 21:26:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:14,767 INFO L93 Difference]: Finished difference Result 90854 states and 367944 transitions. [2019-12-18 21:26:14,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:26:14,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-18 21:26:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:14,997 INFO L225 Difference]: With dead ends: 90854 [2019-12-18 21:26:14,998 INFO L226 Difference]: Without dead ends: 90750 [2019-12-18 21:26:14,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-18 21:26:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90750 states. [2019-12-18 21:26:19,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90750 to 59942. [2019-12-18 21:26:19,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59942 states. [2019-12-18 21:26:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59942 states to 59942 states and 248164 transitions. [2019-12-18 21:26:19,422 INFO L78 Accepts]: Start accepts. Automaton has 59942 states and 248164 transitions. Word has length 35 [2019-12-18 21:26:19,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:19,423 INFO L462 AbstractCegarLoop]: Abstraction has 59942 states and 248164 transitions. [2019-12-18 21:26:19,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 59942 states and 248164 transitions. [2019-12-18 21:26:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 21:26:19,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:19,475 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] [2019-12-18 21:26:19,475 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -29640414, now seen corresponding path program 1 times [2019-12-18 21:26:19,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:19,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029574843] [2019-12-18 21:26:19,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:19,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-18 21:26:19,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029574843] [2019-12-18 21:26:19,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:19,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:19,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276680554] [2019-12-18 21:26:19,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:26:19,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:19,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:26:19,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:26:19,564 INFO L87 Difference]: Start difference. First operand 59942 states and 248164 transitions. Second operand 5 states. [2019-12-18 21:26:19,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:19,926 INFO L93 Difference]: Finished difference Result 61906 states and 256028 transitions. [2019-12-18 21:26:19,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:26:19,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-18 21:26:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:20,730 INFO L225 Difference]: With dead ends: 61906 [2019-12-18 21:26:20,730 INFO L226 Difference]: Without dead ends: 59254 [2019-12-18 21:26:20,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 21:26:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59254 states. [2019-12-18 21:26:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59254 to 59254. [2019-12-18 21:26:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59254 states. [2019-12-18 21:26:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59254 states to 59254 states and 245100 transitions. [2019-12-18 21:26:21,925 INFO L78 Accepts]: Start accepts. Automaton has 59254 states and 245100 transitions. Word has length 35 [2019-12-18 21:26:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:21,926 INFO L462 AbstractCegarLoop]: Abstraction has 59254 states and 245100 transitions. [2019-12-18 21:26:21,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:26:21,926 INFO L276 IsEmpty]: Start isEmpty. Operand 59254 states and 245100 transitions. [2019-12-18 21:26:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 21:26:21,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:21,999 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] [2019-12-18 21:26:21,999 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:21,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1282093875, now seen corresponding path program 1 times [2019-12-18 21:26:22,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:22,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387306142] [2019-12-18 21:26:22,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:22,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387306142] [2019-12-18 21:26:22,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:22,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:22,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354479078] [2019-12-18 21:26:22,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:22,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:22,053 INFO L87 Difference]: Start difference. First operand 59254 states and 245100 transitions. Second operand 3 states. [2019-12-18 21:26:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:24,490 INFO L93 Difference]: Finished difference Result 59254 states and 244380 transitions. [2019-12-18 21:26:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:24,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-18 21:26:24,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:24,677 INFO L225 Difference]: With dead ends: 59254 [2019-12-18 21:26:24,677 INFO L226 Difference]: Without dead ends: 59254 [2019-12-18 21:26:24,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:24,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59254 states. [2019-12-18 21:26:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59254 to 59254. [2019-12-18 21:26:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59254 states. [2019-12-18 21:26:26,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59254 states to 59254 states and 244380 transitions. [2019-12-18 21:26:26,375 INFO L78 Accepts]: Start accepts. Automaton has 59254 states and 244380 transitions. Word has length 36 [2019-12-18 21:26:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:26,376 INFO L462 AbstractCegarLoop]: Abstraction has 59254 states and 244380 transitions. [2019-12-18 21:26:26,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:26,376 INFO L276 IsEmpty]: Start isEmpty. Operand 59254 states and 244380 transitions. [2019-12-18 21:26:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 21:26:26,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:26,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:26,434 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:26,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash -2137371719, now seen corresponding path program 1 times [2019-12-18 21:26:26,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:26,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17904810] [2019-12-18 21:26:26,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:26,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17904810] [2019-12-18 21:26:26,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:26,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:26:26,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466489218] [2019-12-18 21:26:26,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:26:26,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:26,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:26:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:26,689 INFO L87 Difference]: Start difference. First operand 59254 states and 244380 transitions. Second operand 9 states. [2019-12-18 21:26:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:27,803 INFO L93 Difference]: Finished difference Result 120662 states and 502252 transitions. [2019-12-18 21:26:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:26:27,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-18 21:26:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:28,084 INFO L225 Difference]: With dead ends: 120662 [2019-12-18 21:26:28,084 INFO L226 Difference]: Without dead ends: 102634 [2019-12-18 21:26:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-12-18 21:26:28,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102634 states. [2019-12-18 21:26:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102634 to 87222. [2019-12-18 21:26:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87222 states. [2019-12-18 21:26:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87222 states to 87222 states and 362392 transitions. [2019-12-18 21:26:33,468 INFO L78 Accepts]: Start accepts. Automaton has 87222 states and 362392 transitions. Word has length 37 [2019-12-18 21:26:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:33,469 INFO L462 AbstractCegarLoop]: Abstraction has 87222 states and 362392 transitions. [2019-12-18 21:26:33,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:26:33,469 INFO L276 IsEmpty]: Start isEmpty. Operand 87222 states and 362392 transitions. [2019-12-18 21:26:33,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:26:33,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:33,581 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] [2019-12-18 21:26:33,582 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:33,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash 253483219, now seen corresponding path program 1 times [2019-12-18 21:26:33,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:33,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015479555] [2019-12-18 21:26:33,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:34,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015479555] [2019-12-18 21:26:34,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:34,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 21:26:34,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537743390] [2019-12-18 21:26:34,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 21:26:34,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:34,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 21:26:34,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:26:34,516 INFO L87 Difference]: Start difference. First operand 87222 states and 362392 transitions. Second operand 11 states. [2019-12-18 21:26:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:36,056 INFO L93 Difference]: Finished difference Result 145102 states and 606380 transitions. [2019-12-18 21:26:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:26:36,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-18 21:26:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:36,416 INFO L225 Difference]: With dead ends: 145102 [2019-12-18 21:26:36,417 INFO L226 Difference]: Without dead ends: 126838 [2019-12-18 21:26:36,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:26:36,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126838 states. [2019-12-18 21:26:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126838 to 89826. [2019-12-18 21:26:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89826 states. [2019-12-18 21:26:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89826 states to 89826 states and 372900 transitions. [2019-12-18 21:26:39,526 INFO L78 Accepts]: Start accepts. Automaton has 89826 states and 372900 transitions. Word has length 38 [2019-12-18 21:26:39,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:39,526 INFO L462 AbstractCegarLoop]: Abstraction has 89826 states and 372900 transitions. [2019-12-18 21:26:39,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 21:26:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 89826 states and 372900 transitions. [2019-12-18 21:26:39,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:26:39,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:39,643 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] [2019-12-18 21:26:39,643 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:39,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:39,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1019177435, now seen corresponding path program 2 times [2019-12-18 21:26:39,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:39,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802592001] [2019-12-18 21:26:39,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:39,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802592001] [2019-12-18 21:26:39,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:39,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 21:26:39,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663114362] [2019-12-18 21:26:39,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 21:26:39,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:39,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 21:26:39,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:39,807 INFO L87 Difference]: Start difference. First operand 89826 states and 372900 transitions. Second operand 9 states. [2019-12-18 21:26:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:44,893 INFO L93 Difference]: Finished difference Result 162350 states and 676660 transitions. [2019-12-18 21:26:44,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:26:44,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-18 21:26:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:45,316 INFO L225 Difference]: With dead ends: 162350 [2019-12-18 21:26:45,316 INFO L226 Difference]: Without dead ends: 142366 [2019-12-18 21:26:45,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:26:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142366 states. [2019-12-18 21:26:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142366 to 92498. [2019-12-18 21:26:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92498 states. [2019-12-18 21:26:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92498 states to 92498 states and 382988 transitions. [2019-12-18 21:26:48,091 INFO L78 Accepts]: Start accepts. Automaton has 92498 states and 382988 transitions. Word has length 38 [2019-12-18 21:26:48,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:48,091 INFO L462 AbstractCegarLoop]: Abstraction has 92498 states and 382988 transitions. [2019-12-18 21:26:48,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 21:26:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 92498 states and 382988 transitions. [2019-12-18 21:26:48,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 21:26:48,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:48,219 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] [2019-12-18 21:26:48,219 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:48,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:48,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1000547259, now seen corresponding path program 3 times [2019-12-18 21:26:48,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:48,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827803899] [2019-12-18 21:26:48,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:48,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827803899] [2019-12-18 21:26:48,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:48,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:26:48,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426973971] [2019-12-18 21:26:48,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:26:48,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:48,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:26:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:26:48,303 INFO L87 Difference]: Start difference. First operand 92498 states and 382988 transitions. Second operand 4 states. [2019-12-18 21:26:48,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:48,663 INFO L93 Difference]: Finished difference Result 72834 states and 277465 transitions. [2019-12-18 21:26:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:26:48,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-18 21:26:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:48,824 INFO L225 Difference]: With dead ends: 72834 [2019-12-18 21:26:48,824 INFO L226 Difference]: Without dead ends: 71662 [2019-12-18 21:26:48,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:26:49,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71662 states. [2019-12-18 21:26:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71662 to 71662. [2019-12-18 21:26:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71662 states. [2019-12-18 21:26:51,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71662 states to 71662 states and 273749 transitions. [2019-12-18 21:26:51,234 INFO L78 Accepts]: Start accepts. Automaton has 71662 states and 273749 transitions. Word has length 38 [2019-12-18 21:26:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:51,234 INFO L462 AbstractCegarLoop]: Abstraction has 71662 states and 273749 transitions. [2019-12-18 21:26:51,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:26:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 71662 states and 273749 transitions. [2019-12-18 21:26:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:26:51,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:51,318 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:51,318 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:51,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:51,318 INFO L82 PathProgramCache]: Analyzing trace with hash 687344541, now seen corresponding path program 1 times [2019-12-18 21:26:51,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:51,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378451766] [2019-12-18 21:26:51,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:51,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378451766] [2019-12-18 21:26:51,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:51,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:26:51,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90426327] [2019-12-18 21:26:51,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:51,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:51,430 INFO L87 Difference]: Start difference. First operand 71662 states and 273749 transitions. Second operand 7 states. [2019-12-18 21:26:52,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:52,103 INFO L93 Difference]: Finished difference Result 116160 states and 437724 transitions. [2019-12-18 21:26:52,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:26:52,104 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2019-12-18 21:26:52,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:52,959 INFO L225 Difference]: With dead ends: 116160 [2019-12-18 21:26:52,959 INFO L226 Difference]: Without dead ends: 69391 [2019-12-18 21:26:52,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:26:53,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69391 states. [2019-12-18 21:26:53,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69391 to 60025. [2019-12-18 21:26:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60025 states. [2019-12-18 21:26:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60025 states to 60025 states and 226422 transitions. [2019-12-18 21:26:54,140 INFO L78 Accepts]: Start accepts. Automaton has 60025 states and 226422 transitions. Word has length 39 [2019-12-18 21:26:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:54,140 INFO L462 AbstractCegarLoop]: Abstraction has 60025 states and 226422 transitions. [2019-12-18 21:26:54,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 60025 states and 226422 transitions. [2019-12-18 21:26:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 21:26:54,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:54,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:54,200 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:54,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1394445557, now seen corresponding path program 1 times [2019-12-18 21:26:54,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:54,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358592] [2019-12-18 21:26:54,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:54,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:54,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358592] [2019-12-18 21:26:54,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:54,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:26:54,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713310701] [2019-12-18 21:26:54,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:26:54,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:54,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:26:54,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:26:54,274 INFO L87 Difference]: Start difference. First operand 60025 states and 226422 transitions. Second operand 5 states. [2019-12-18 21:26:54,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:54,400 INFO L93 Difference]: Finished difference Result 20560 states and 65685 transitions. [2019-12-18 21:26:54,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:26:54,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-18 21:26:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:54,428 INFO L225 Difference]: With dead ends: 20560 [2019-12-18 21:26:54,429 INFO L226 Difference]: Without dead ends: 19714 [2019-12-18 21:26:54,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19714 states. [2019-12-18 21:26:54,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19714 to 19714. [2019-12-18 21:26:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19714 states. [2019-12-18 21:26:54,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19714 states to 19714 states and 62974 transitions. [2019-12-18 21:26:54,725 INFO L78 Accepts]: Start accepts. Automaton has 19714 states and 62974 transitions. Word has length 39 [2019-12-18 21:26:54,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:54,726 INFO L462 AbstractCegarLoop]: Abstraction has 19714 states and 62974 transitions. [2019-12-18 21:26:54,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:26:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 19714 states and 62974 transitions. [2019-12-18 21:26:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:26:54,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:54,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:54,739 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:54,740 INFO L82 PathProgramCache]: Analyzing trace with hash -142053109, now seen corresponding path program 1 times [2019-12-18 21:26:54,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:54,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771356983] [2019-12-18 21:26:54,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:55,244 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 4 [2019-12-18 21:26:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:55,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771356983] [2019-12-18 21:26:55,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:55,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:26:55,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236369082] [2019-12-18 21:26:55,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:55,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:55,253 INFO L87 Difference]: Start difference. First operand 19714 states and 62974 transitions. Second operand 7 states. [2019-12-18 21:26:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:55,527 INFO L93 Difference]: Finished difference Result 37324 states and 119689 transitions. [2019-12-18 21:26:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:26:55,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-18 21:26:55,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:55,559 INFO L225 Difference]: With dead ends: 37324 [2019-12-18 21:26:55,560 INFO L226 Difference]: Without dead ends: 22556 [2019-12-18 21:26:55,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:26:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22556 states. [2019-12-18 21:26:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22556 to 19695. [2019-12-18 21:26:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19695 states. [2019-12-18 21:26:55,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19695 states to 19695 states and 60923 transitions. [2019-12-18 21:26:55,882 INFO L78 Accepts]: Start accepts. Automaton has 19695 states and 60923 transitions. Word has length 40 [2019-12-18 21:26:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:55,882 INFO L462 AbstractCegarLoop]: Abstraction has 19695 states and 60923 transitions. [2019-12-18 21:26:55,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 19695 states and 60923 transitions. [2019-12-18 21:26:55,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 21:26:55,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:55,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:55,897 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:55,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:55,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1756786001, now seen corresponding path program 2 times [2019-12-18 21:26:55,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:55,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627601147] [2019-12-18 21:26:55,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:55,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627601147] [2019-12-18 21:26:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:55,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:26:55,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476848084] [2019-12-18 21:26:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:26:55,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:26:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:26:55,985 INFO L87 Difference]: Start difference. First operand 19695 states and 60923 transitions. Second operand 6 states. [2019-12-18 21:26:56,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:56,068 INFO L93 Difference]: Finished difference Result 3472 states and 8391 transitions. [2019-12-18 21:26:56,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:26:56,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-18 21:26:56,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:56,075 INFO L225 Difference]: With dead ends: 3472 [2019-12-18 21:26:56,076 INFO L226 Difference]: Without dead ends: 3129 [2019-12-18 21:26:56,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:26:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2019-12-18 21:26:56,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3061. [2019-12-18 21:26:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3061 states. [2019-12-18 21:26:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3061 states to 3061 states and 7270 transitions. [2019-12-18 21:26:56,145 INFO L78 Accepts]: Start accepts. Automaton has 3061 states and 7270 transitions. Word has length 40 [2019-12-18 21:26:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:56,145 INFO L462 AbstractCegarLoop]: Abstraction has 3061 states and 7270 transitions. [2019-12-18 21:26:56,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:26:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3061 states and 7270 transitions. [2019-12-18 21:26:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-18 21:26:56,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:56,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:56,151 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:56,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:56,152 INFO L82 PathProgramCache]: Analyzing trace with hash 323536583, now seen corresponding path program 1 times [2019-12-18 21:26:56,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:56,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385312283] [2019-12-18 21:26:56,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:56,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385312283] [2019-12-18 21:26:56,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:56,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:26:56,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361071305] [2019-12-18 21:26:56,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:56,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:56,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:56,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:56,306 INFO L87 Difference]: Start difference. First operand 3061 states and 7270 transitions. Second operand 7 states. [2019-12-18 21:26:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:56,449 INFO L93 Difference]: Finished difference Result 1189 states and 3023 transitions. [2019-12-18 21:26:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 21:26:56,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-18 21:26:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:56,452 INFO L225 Difference]: With dead ends: 1189 [2019-12-18 21:26:56,452 INFO L226 Difference]: Without dead ends: 866 [2019-12-18 21:26:56,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:26:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2019-12-18 21:26:56,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 782. [2019-12-18 21:26:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 21:26:56,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1884 transitions. [2019-12-18 21:26:56,472 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1884 transitions. Word has length 48 [2019-12-18 21:26:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:56,472 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1884 transitions. [2019-12-18 21:26:56,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1884 transitions. [2019-12-18 21:26:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 21:26:56,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:56,474 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] [2019-12-18 21:26:56,474 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2083563203, now seen corresponding path program 1 times [2019-12-18 21:26:56,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:56,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149043332] [2019-12-18 21:26:56,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:56,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149043332] [2019-12-18 21:26:56,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:56,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:26:56,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272148787] [2019-12-18 21:26:56,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:26:56,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:56,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:26:56,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:56,577 INFO L87 Difference]: Start difference. First operand 782 states and 1884 transitions. Second operand 3 states. [2019-12-18 21:26:56,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:56,600 INFO L93 Difference]: Finished difference Result 748 states and 1760 transitions. [2019-12-18 21:26:56,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:26:56,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 21:26:56,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:56,603 INFO L225 Difference]: With dead ends: 748 [2019-12-18 21:26:56,603 INFO L226 Difference]: Without dead ends: 748 [2019-12-18 21:26:56,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:26:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-12-18 21:26:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-12-18 21:26:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-12-18 21:26:56,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1760 transitions. [2019-12-18 21:26:56,620 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1760 transitions. Word has length 59 [2019-12-18 21:26:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:56,620 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1760 transitions. [2019-12-18 21:26:56,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:26:56,621 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1760 transitions. [2019-12-18 21:26:56,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:26:56,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:56,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:26:56,623 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:56,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1577814574, now seen corresponding path program 1 times [2019-12-18 21:26:56,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:56,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578215611] [2019-12-18 21:26:56,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:56,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578215611] [2019-12-18 21:26:56,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:56,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:26:56,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276915905] [2019-12-18 21:26:56,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:26:56,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:26:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:26:56,837 INFO L87 Difference]: Start difference. First operand 748 states and 1760 transitions. Second operand 7 states. [2019-12-18 21:26:57,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:57,004 INFO L93 Difference]: Finished difference Result 1018 states and 2316 transitions. [2019-12-18 21:26:57,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:26:57,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2019-12-18 21:26:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:57,006 INFO L225 Difference]: With dead ends: 1018 [2019-12-18 21:26:57,006 INFO L226 Difference]: Without dead ends: 248 [2019-12-18 21:26:57,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-18 21:26:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-18 21:26:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-18 21:26:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-18 21:26:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 390 transitions. [2019-12-18 21:26:57,012 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 390 transitions. Word has length 60 [2019-12-18 21:26:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:57,013 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 390 transitions. [2019-12-18 21:26:57,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:26:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 390 transitions. [2019-12-18 21:26:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:26:57,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:57,014 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] [2019-12-18 21:26:57,015 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:57,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:57,015 INFO L82 PathProgramCache]: Analyzing trace with hash -450753008, now seen corresponding path program 2 times [2019-12-18 21:26:57,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:57,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394551478] [2019-12-18 21:26:57,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:57,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394551478] [2019-12-18 21:26:57,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:57,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:26:57,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339783704] [2019-12-18 21:26:57,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:26:57,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:26:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:26:57,347 INFO L87 Difference]: Start difference. First operand 224 states and 390 transitions. Second operand 14 states. [2019-12-18 21:26:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:57,863 INFO L93 Difference]: Finished difference Result 385 states and 652 transitions. [2019-12-18 21:26:57,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 21:26:57,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-18 21:26:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:57,865 INFO L225 Difference]: With dead ends: 385 [2019-12-18 21:26:57,865 INFO L226 Difference]: Without dead ends: 350 [2019-12-18 21:26:57,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:26:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-18 21:26:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 320. [2019-12-18 21:26:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-18 21:26:57,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 554 transitions. [2019-12-18 21:26:57,871 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 554 transitions. Word has length 60 [2019-12-18 21:26:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:57,871 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 554 transitions. [2019-12-18 21:26:57,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:26:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 554 transitions. [2019-12-18 21:26:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:26:57,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:57,872 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] [2019-12-18 21:26:57,872 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1199767330, now seen corresponding path program 3 times [2019-12-18 21:26:57,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:57,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319985117] [2019-12-18 21:26:57,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:26:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:26:58,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319985117] [2019-12-18 21:26:58,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:26:58,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:26:58,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356063521] [2019-12-18 21:26:58,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 21:26:58,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:26:58,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 21:26:58,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:26:58,087 INFO L87 Difference]: Start difference. First operand 320 states and 554 transitions. Second operand 13 states. [2019-12-18 21:26:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:26:58,560 INFO L93 Difference]: Finished difference Result 425 states and 710 transitions. [2019-12-18 21:26:58,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:26:58,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-18 21:26:58,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:26:58,561 INFO L225 Difference]: With dead ends: 425 [2019-12-18 21:26:58,561 INFO L226 Difference]: Without dead ends: 390 [2019-12-18 21:26:58,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2019-12-18 21:26:58,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-18 21:26:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 332. [2019-12-18 21:26:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-12-18 21:26:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 575 transitions. [2019-12-18 21:26:58,567 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 575 transitions. Word has length 60 [2019-12-18 21:26:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:26:58,567 INFO L462 AbstractCegarLoop]: Abstraction has 332 states and 575 transitions. [2019-12-18 21:26:58,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 21:26:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 575 transitions. [2019-12-18 21:26:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-18 21:26:58,568 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:26:58,568 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] [2019-12-18 21:26:58,568 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:26:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:26:58,568 INFO L82 PathProgramCache]: Analyzing trace with hash 790518800, now seen corresponding path program 4 times [2019-12-18 21:26:58,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:26:58,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763914110] [2019-12-18 21:26:58,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:26:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:26:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:26:58,690 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:26:58,690 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:26:58,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~z$w_buff1~0_23) (= v_~x~0_11 0) (= 0 v_~z$r_buff1_thd1~0_10) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~z$w_buff0_used~0_104 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1141~0.base_21|) |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0)) |v_#memory_int_27|) (= v_~z$r_buff0_thd4~0_29 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21| 1)) (= v_~z$r_buff0_thd0~0_83 0) (= 0 v_~__unbuffered_p3_EAX~0_12) (= 0 v_~weak$$choice2~0_32) (= v_~z$read_delayed~0_5 0) (= 0 v_~z$r_buff1_thd0~0_50) (= |v_#length_27| (store |v_#length_28| |v_ULTIMATE.start_main_~#t1141~0.base_21| 4)) (= 0 v_~z$flush_delayed~0_17) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~z$r_buff1_thd2~0_10) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1141~0.base_21|)) (= 0 v_~z$w_buff1_used~0_64) (= v_~a~0_10 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~__unbuffered_cnt~0_24) (< 0 |v_#StackHeapBarrier_20|) (= |v_ULTIMATE.start_main_~#t1141~0.offset_16| 0) (= v_~z$r_buff0_thd1~0_11 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_12) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1141~0.base_21|) (= v_~z$r_buff0_thd2~0_9 0) (= v_~z$mem_tmp~0_12 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= v_~main$tmp_guard0~0_11 0) (= v_~b~0_12 0) (= v_~main$tmp_guard1~0_13 0) (= v_~z$r_buff0_thd3~0_22 0) (= 0 v_~z$r_buff1_thd3~0_17) (= 0 v_~z$r_buff1_thd4~0_19))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_13|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_16|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_8|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_83, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_12, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_14|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_11|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_64, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_10|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_14|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_22, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~x~0=v_~x~0_11, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_19, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_11|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_22|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~z$w_buff1~0=v_~z$w_buff1~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_10|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t1141~0.base=|v_ULTIMATE.start_main_~#t1141~0.base_21|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_8|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_8|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_13|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_50, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_6|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_16|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_9, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_10|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_6|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_11|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_13|, ULTIMATE.start_main_~#t1141~0.offset=|v_ULTIMATE.start_main_~#t1141~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~b~0=v_~b~0_12, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_21|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_5|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_~#t1144~0.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1142~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_~#t1144~0.base, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1141~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ULTIMATE.start_main_~#t1143~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1142~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1141~0.offset, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:26:58,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L835-1-->L837: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1142~0.base_12|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1142~0.base_12| 1)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1142~0.base_12|) |v_ULTIMATE.start_main_~#t1142~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t1142~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1142~0.base_12| 4) |v_#length_21|) (= |v_ULTIMATE.start_main_~#t1142~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1142~0.base=|v_ULTIMATE.start_main_~#t1142~0.base_12|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1142~0.offset=|v_ULTIMATE.start_main_~#t1142~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1142~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1142~0.offset] because there is no mapped edge [2019-12-18 21:26:58,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L837-1-->L839: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1143~0.base_8| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1143~0.base_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1143~0.base_8|) |v_ULTIMATE.start_main_~#t1143~0.offset_8| 2)) |v_#memory_int_17|) (= 0 |v_ULTIMATE.start_main_~#t1143~0.offset_8|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1143~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1143~0.base=|v_ULTIMATE.start_main_~#t1143~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1143~0.offset=|v_ULTIMATE.start_main_~#t1143~0.offset_8|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1143~0.base, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1143~0.offset] because there is no mapped edge [2019-12-18 21:26:58,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L839-1-->L841: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1144~0.base_12|)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12| 1)) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1144~0.base_12|) |v_ULTIMATE.start_main_~#t1144~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1144~0.offset_10| 0) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1144~0.base_12|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1144~0.base_12|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1144~0.base_12| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1144~0.base=|v_ULTIMATE.start_main_~#t1144~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1144~0.offset=|v_ULTIMATE.start_main_~#t1144~0.offset_10|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1144~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1144~0.offset, #length, ULTIMATE.start_main_#t~nondet17] because there is no mapped edge [2019-12-18 21:26:58,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L4-->L812: Formula: (and (= ~z$r_buff0_thd1~0_In1169597882 ~z$r_buff1_thd1~0_Out1169597882) (= ~a~0_Out1169597882 1) (= ~z$r_buff1_thd3~0_Out1169597882 ~z$r_buff0_thd3~0_In1169597882) (= ~a~0_Out1169597882 ~__unbuffered_p3_EAX~0_Out1169597882) (not (= 0 P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1169597882)) (= ~z$r_buff1_thd2~0_Out1169597882 ~z$r_buff0_thd2~0_In1169597882) (= 1 ~z$r_buff0_thd4~0_Out1169597882) (= ~z$r_buff0_thd0~0_In1169597882 ~z$r_buff1_thd0~0_Out1169597882) (= ~b~0_In1169597882 ~__unbuffered_p3_EBX~0_Out1169597882) (= ~z$r_buff1_thd4~0_Out1169597882 ~z$r_buff0_thd4~0_In1169597882)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1169597882, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169597882, ~b~0=~b~0_In1169597882, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1169597882, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1169597882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169597882, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1169597882} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In1169597882, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out1169597882, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out1169597882, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out1169597882, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out1169597882, ~a~0=~a~0_Out1169597882, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1169597882, ~b~0=~b~0_In1169597882, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1169597882, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out1169597882, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out1169597882, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1169597882, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1169597882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1169597882, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1169597882} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-18 21:26:58,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] P0ENTRY-->P0EXIT: Formula: (and (= v_~__unbuffered_p0_EAX~0_6 v_~x~0_7) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= 1 v_~b~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_7} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_6, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_7, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:26:58,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~__unbuffered_p1_EAX~0_6 v_~y~0_5) (= 1 v_~x~0_5) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~y~0=v_~y~0_5} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_6, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_5, ~x~0=v_~x~0_5, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:26:58,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-939200672 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-939200672 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out-939200672| 0) (not .cse0) (not .cse1)) (and (= |P3Thread1of1ForFork3_#t~ite11_Out-939200672| ~z$w_buff0_used~0_In-939200672) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-939200672, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-939200672} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-939200672, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-939200672, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-939200672|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:26:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-974705457 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-974705457 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-974705457 |P2Thread1of1ForFork2_#t~ite3_Out-974705457|) (not .cse1)) (and (= ~z~0_In-974705457 |P2Thread1of1ForFork2_#t~ite3_Out-974705457|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-974705457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-974705457, ~z$w_buff1~0=~z$w_buff1~0_In-974705457, ~z~0=~z~0_In-974705457} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-974705457|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-974705457, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-974705457, ~z$w_buff1~0=~z$w_buff1~0_In-974705457, ~z~0=~z~0_In-974705457} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:26:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_15 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_7|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-18 21:26:58,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-2089080638 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2089080638 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite5_Out-2089080638| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out-2089080638| ~z$w_buff0_used~0_In-2089080638) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089080638, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2089080638} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-2089080638|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2089080638, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2089080638} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:26:58,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-371004201 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-371004201 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-371004201 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-371004201 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-371004201| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite6_Out-371004201| ~z$w_buff1_used~0_In-371004201)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-371004201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-371004201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-371004201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-371004201} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-371004201|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-371004201, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-371004201, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-371004201, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-371004201} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:26:58,705 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2084975729 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2084975729 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-2084975729| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-2084975729| ~z$r_buff0_thd3~0_In-2084975729)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084975729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2084975729} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2084975729, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2084975729, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-2084975729|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:26:58,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In228970160 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In228970160 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In228970160 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In228970160 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In228970160 |P2Thread1of1ForFork2_#t~ite8_Out228970160|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite8_Out228970160|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In228970160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In228970160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228970160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In228970160} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In228970160, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In228970160, ~z$w_buff1_used~0=~z$w_buff1_used~0_In228970160, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In228970160, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out228970160|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:26:58,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= v_~z$r_buff1_thd3~0_14 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_14, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:26:58,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In321413157 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In321413157 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In321413157 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In321413157 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out321413157|)) (and (= ~z$w_buff1_used~0_In321413157 |P3Thread1of1ForFork3_#t~ite12_Out321413157|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In321413157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In321413157, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In321413157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In321413157} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In321413157, ~z$w_buff0_used~0=~z$w_buff0_used~0_In321413157, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In321413157, ~z$w_buff1_used~0=~z$w_buff1_used~0_In321413157, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out321413157|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-18 21:26:58,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1099432917 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1099432917 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out1099432917 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd4~0_Out1099432917 ~z$r_buff0_thd4~0_In1099432917)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1099432917, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1099432917} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1099432917, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1099432917, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out1099432917|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-18 21:26:58,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd4~0_In1924584027 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In1924584027 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1924584027 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1924584027 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1924584027|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P3Thread1of1ForFork3_#t~ite14_Out1924584027| ~z$r_buff1_thd4~0_In1924584027)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1924584027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924584027, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1924584027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924584027} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1924584027, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1924584027, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1924584027|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1924584027, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1924584027} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-18 21:26:58,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite14_8| v_~z$r_buff1_thd4~0_16) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_16, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:26:58,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= (mod v_~z$r_buff0_thd0~0_47 256) 0) (= (mod v_~z$w_buff0_used~0_70 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_47, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_70, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:26:58,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In98849675 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In98849675 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite20_Out98849675| |ULTIMATE.start_main_#t~ite19_Out98849675|))) (or (and (= ~z$w_buff1~0_In98849675 |ULTIMATE.start_main_#t~ite19_Out98849675|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= |ULTIMATE.start_main_#t~ite19_Out98849675| ~z~0_In98849675) .cse1))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In98849675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In98849675, ~z$w_buff1~0=~z$w_buff1~0_In98849675, ~z~0=~z~0_In98849675} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out98849675|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In98849675, ~z$w_buff1_used~0=~z$w_buff1_used~0_In98849675, ~z$w_buff1~0=~z$w_buff1~0_In98849675, ~z~0=~z~0_In98849675, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out98849675|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:26:58,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1561131908 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1561131908 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1561131908| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1561131908| ~z$w_buff0_used~0_In1561131908)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1561131908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1561131908} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1561131908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1561131908, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1561131908|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:26:58,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-47561896 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-47561896 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-47561896 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-47561896 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out-47561896| ~z$w_buff1_used~0_In-47561896) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out-47561896| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-47561896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-47561896, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-47561896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-47561896} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-47561896, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-47561896, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-47561896, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-47561896, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-47561896|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:26:58,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-198852011 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-198852011 256)))) (or (and (= ~z$r_buff0_thd0~0_In-198852011 |ULTIMATE.start_main_#t~ite23_Out-198852011|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite23_Out-198852011|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198852011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-198852011} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-198852011, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-198852011, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-198852011|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:26:58,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In2066862254 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd0~0_In2066862254 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2066862254 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2066862254 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite24_Out2066862254| ~z$r_buff1_thd0~0_In2066862254) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite24_Out2066862254| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2066862254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2066862254, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2066862254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2066862254} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2066862254, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2066862254, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2066862254, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out2066862254|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2066862254} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-18 21:26:58,720 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L861-->L861-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In815601890 256) 0))) (or (and .cse0 (= ~z$w_buff0_used~0_In815601890 |ULTIMATE.start_main_#t~ite36_Out815601890|) (= |ULTIMATE.start_main_#t~ite37_Out815601890| |ULTIMATE.start_main_#t~ite36_Out815601890|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In815601890 256)))) (or (and (= 0 (mod ~z$w_buff1_used~0_In815601890 256)) .cse1) (and .cse1 (= (mod ~z$r_buff1_thd0~0_In815601890 256) 0)) (= (mod ~z$w_buff0_used~0_In815601890 256) 0)))) (and (= |ULTIMATE.start_main_#t~ite36_In815601890| |ULTIMATE.start_main_#t~ite36_Out815601890|) (= ~z$w_buff0_used~0_In815601890 |ULTIMATE.start_main_#t~ite37_Out815601890|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In815601890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In815601890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In815601890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In815601890, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In815601890|, ~weak$$choice2~0=~weak$$choice2~0_In815601890} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In815601890, ~z$w_buff0_used~0=~z$w_buff0_used~0_In815601890, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In815601890, ~z$w_buff1_used~0=~z$w_buff1_used~0_In815601890, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out815601890|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out815601890|, ~weak$$choice2~0=~weak$$choice2~0_In815601890} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 21:26:58,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1066867555 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1066867555 256)))) (or (= (mod ~z$w_buff0_used~0_In-1066867555 256) 0) (and (= 0 (mod ~z$r_buff1_thd0~0_In-1066867555 256)) .cse1) (and (= (mod ~z$w_buff1_used~0_In-1066867555 256) 0) .cse1))) (= ~z$w_buff1_used~0_In-1066867555 |ULTIMATE.start_main_#t~ite39_Out-1066867555|) (= |ULTIMATE.start_main_#t~ite40_Out-1066867555| |ULTIMATE.start_main_#t~ite39_Out-1066867555|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1066867555| ~z$w_buff1_used~0_In-1066867555) (= |ULTIMATE.start_main_#t~ite39_In-1066867555| |ULTIMATE.start_main_#t~ite39_Out-1066867555|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1066867555, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066867555, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In-1066867555|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1066867555, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1066867555, ~weak$$choice2~0=~weak$$choice2~0_In-1066867555} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1066867555, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1066867555|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1066867555|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1066867555, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1066867555, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1066867555, ~weak$$choice2~0=~weak$$choice2~0_In-1066867555} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 21:26:58,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (= v_~z$r_buff0_thd0~0_58 v_~z$r_buff0_thd0~0_57) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_57, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:26:58,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~z~0_21 v_~z$mem_tmp~0_7) (= 0 v_~z$flush_delayed~0_10) (not (= (mod v_~z$flush_delayed~0_11 256) 0))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:26:58,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:26:58,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:26:58 BasicIcfg [2019-12-18 21:26:58,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:26:58,816 INFO L168 Benchmark]: Toolchain (without parser) took 82390.30 ms. Allocated memory was 145.8 MB in the beginning and 3.3 GB in the end (delta: 3.2 GB). Free memory was 101.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,817 INFO L168 Benchmark]: CDTParser took 1.79 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.44 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 155.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,818 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,819 INFO L168 Benchmark]: Boogie Preprocessor took 41.55 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,819 INFO L168 Benchmark]: RCFGBuilder took 822.32 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,826 INFO L168 Benchmark]: TraceAbstraction took 80643.98 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 21:26:58,830 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.79 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.44 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 155.8 MB in the end (delta: -54.4 MB). Peak memory consumption was 22.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 152.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.55 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 150.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.32 ms. Allocated memory is still 202.4 MB. Free memory was 150.0 MB in the beginning and 100.9 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80643.98 ms. Allocated memory was 202.4 MB in the beginning and 3.3 GB in the end (delta: 3.1 GB). Free memory was 100.2 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 182 ProgramPointsBefore, 91 ProgramPointsAfterwards, 210 TransitionsBefore, 98 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 4581 VarBasedMoverChecksPositive, 178 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 57720 CheckedPairsTotal, 124 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1141, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1142, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1143, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1144, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 80.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3544 SDtfs, 4181 SDslu, 11013 SDs, 0 SdLazy, 4086 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92498occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 197463 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 880 NumberOfCodeBlocks, 880 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 798 ConstructedInterpolants, 0 QuantifiedInterpolants, 181029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...