/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:24:19,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:24:19,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:24:19,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:24:19,129 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:24:19,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:24:19,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:24:19,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:24:19,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:24:19,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:24:19,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:24:19,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:24:19,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:24:19,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:24:19,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:24:19,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:24:19,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:24:19,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:24:19,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:24:19,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:24:19,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:24:19,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:24:19,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:24:19,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:24:19,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:24:19,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:24:19,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:24:19,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:24:19,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:24:19,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:24:19,159 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:24:19,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:24:19,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:24:19,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:24:19,162 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:24:19,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:24:19,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:24:19,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:24:19,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:24:19,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:24:19,165 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:24:19,166 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:24:19,181 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:24:19,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:24:19,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:24:19,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:24:19,183 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:24:19,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:24:19,183 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:24:19,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:24:19,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:24:19,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:24:19,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:24:19,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:24:19,185 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:24:19,185 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:24:19,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:24:19,185 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:24:19,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:24:19,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:24:19,187 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:24:19,187 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:24:19,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:24:19,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:24:19,188 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:24:19,188 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:24:19,189 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:24:19,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:24:19,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:24:19,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:24:19,502 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:24:19,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:24:19,505 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:24:19,506 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 16:24:19,577 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411a33ada/da652d4738f54475b588339e3533c69a/FLAG43f6ba24e [2019-12-27 16:24:20,133 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:24:20,134 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_tso.opt.i [2019-12-27 16:24:20,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411a33ada/da652d4738f54475b588339e3533c69a/FLAG43f6ba24e [2019-12-27 16:24:20,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/411a33ada/da652d4738f54475b588339e3533c69a [2019-12-27 16:24:20,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:24:20,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:24:20,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:24:20,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:24:20,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:24:20,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:24:20" (1/1) ... [2019-12-27 16:24:20,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85f7a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:20, skipping insertion in model container [2019-12-27 16:24:20,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:24:20" (1/1) ... [2019-12-27 16:24:20,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:24:20,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:24:21,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:24:21,099 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:24:21,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:24:21,272 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:24:21,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21 WrapperNode [2019-12-27 16:24:21,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:24:21,273 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:24:21,273 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:24:21,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:24:21,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:24:21,344 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:24:21,344 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:24:21,344 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:24:21,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,359 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... [2019-12-27 16:24:21,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:24:21,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:24:21,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:24:21,384 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:24:21,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:24:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:24:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:24:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:24:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:24:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:24:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:24:21,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:24:21,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:24:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:24:21,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:24:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:24:21,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:24:21,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:24:21,451 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:24:22,205 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:24:22,205 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:24:22,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:24:22 BoogieIcfgContainer [2019-12-27 16:24:22,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:24:22,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:24:22,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:24:22,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:24:22,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:24:20" (1/3) ... [2019-12-27 16:24:22,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9fec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:24:22, skipping insertion in model container [2019-12-27 16:24:22,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:24:21" (2/3) ... [2019-12-27 16:24:22,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9fec81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:24:22, skipping insertion in model container [2019-12-27 16:24:22,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:24:22" (3/3) ... [2019-12-27 16:24:22,218 INFO L109 eAbstractionObserver]: Analyzing ICFG mix024_tso.opt.i [2019-12-27 16:24:22,228 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:24:22,229 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:24:22,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:24:22,241 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:24:22,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,290 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,290 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,291 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,291 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,292 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,292 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,293 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,294 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,295 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,296 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,297 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,298 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,299 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,300 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,304 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,305 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,321 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,324 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,325 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,329 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,330 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,331 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,339 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,340 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,341 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,342 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,343 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,344 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,345 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,346 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,347 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,348 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,349 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,350 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,351 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,352 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,353 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,356 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,357 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,357 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,358 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,359 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,360 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,368 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,373 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:24:22,394 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 16:24:22,415 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:24:22,415 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:24:22,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:24:22,416 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:24:22,416 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:24:22,416 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:24:22,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:24:22,416 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:24:22,436 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-27 16:24:22,438 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:24:22,551 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:24:22,551 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:24:22,568 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:24:22,591 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-27 16:24:22,648 INFO L132 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-27 16:24:22,648 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:24:22,657 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 431 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 16:24:22,678 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 16:24:22,679 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:24:27,658 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 16:24:28,051 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 16:24:28,202 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 16:24:28,230 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78858 [2019-12-27 16:24:28,230 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 16:24:28,234 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-27 16:24:48,173 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 115112 states. [2019-12-27 16:24:48,175 INFO L276 IsEmpty]: Start isEmpty. Operand 115112 states. [2019-12-27 16:24:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 16:24:48,180 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:24:48,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 16:24:48,181 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:24:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:24:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash 917918, now seen corresponding path program 1 times [2019-12-27 16:24:48,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:24:48,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151984814] [2019-12-27 16:24:48,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:24:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:24:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:24:48,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151984814] [2019-12-27 16:24:48,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:24:48,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:24:48,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [549835993] [2019-12-27 16:24:48,435 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:24:48,439 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:24:48,449 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 16:24:48,449 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:24:48,453 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:24:48,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:24:48,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:24:48,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:24:48,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:48,468 INFO L87 Difference]: Start difference. First operand 115112 states. Second operand 3 states. [2019-12-27 16:24:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:24:49,969 INFO L93 Difference]: Finished difference Result 114110 states and 484570 transitions. [2019-12-27 16:24:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:24:49,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 16:24:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:24:50,716 INFO L225 Difference]: With dead ends: 114110 [2019-12-27 16:24:50,716 INFO L226 Difference]: Without dead ends: 107012 [2019-12-27 16:24:50,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:24:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107012 states. [2019-12-27 16:25:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107012 to 107012. [2019-12-27 16:25:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107012 states. [2019-12-27 16:25:04,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107012 states to 107012 states and 453812 transitions. [2019-12-27 16:25:04,789 INFO L78 Accepts]: Start accepts. Automaton has 107012 states and 453812 transitions. Word has length 3 [2019-12-27 16:25:04,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:04,789 INFO L462 AbstractCegarLoop]: Abstraction has 107012 states and 453812 transitions. [2019-12-27 16:25:04,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 107012 states and 453812 transitions. [2019-12-27 16:25:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:25:04,793 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:04,793 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:04,794 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1578322365, now seen corresponding path program 1 times [2019-12-27 16:25:04,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:04,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520629756] [2019-12-27 16:25:04,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:04,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520629756] [2019-12-27 16:25:04,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:04,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:04,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542140641] [2019-12-27 16:25:04,917 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:04,918 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:04,922 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:25:04,924 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:04,925 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:04,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:25:04,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:25:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:25:04,928 INFO L87 Difference]: Start difference. First operand 107012 states and 453812 transitions. Second operand 4 states. [2019-12-27 16:25:10,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:10,311 INFO L93 Difference]: Finished difference Result 166210 states and 677236 transitions. [2019-12-27 16:25:10,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:10,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 16:25:10,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:11,076 INFO L225 Difference]: With dead ends: 166210 [2019-12-27 16:25:11,076 INFO L226 Difference]: Without dead ends: 166161 [2019-12-27 16:25:11,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166161 states. [2019-12-27 16:25:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166161 to 151748. [2019-12-27 16:25:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151748 states. [2019-12-27 16:25:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151748 states to 151748 states and 626089 transitions. [2019-12-27 16:25:26,730 INFO L78 Accepts]: Start accepts. Automaton has 151748 states and 626089 transitions. Word has length 11 [2019-12-27 16:25:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:26,730 INFO L462 AbstractCegarLoop]: Abstraction has 151748 states and 626089 transitions. [2019-12-27 16:25:26,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:25:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 151748 states and 626089 transitions. [2019-12-27 16:25:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 16:25:26,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:26,738 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:26,739 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:26,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:26,739 INFO L82 PathProgramCache]: Analyzing trace with hash 608601994, now seen corresponding path program 1 times [2019-12-27 16:25:26,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:26,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925539160] [2019-12-27 16:25:26,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:26,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925539160] [2019-12-27 16:25:26,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:26,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:26,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1562256639] [2019-12-27 16:25:26,812 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:26,819 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:26,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 16:25:26,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:26,824 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:26,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:26,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:26,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:26,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:26,825 INFO L87 Difference]: Start difference. First operand 151748 states and 626089 transitions. Second operand 3 states. [2019-12-27 16:25:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:26,991 INFO L93 Difference]: Finished difference Result 33068 states and 106908 transitions. [2019-12-27 16:25:26,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:26,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 16:25:26,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:27,044 INFO L225 Difference]: With dead ends: 33068 [2019-12-27 16:25:27,044 INFO L226 Difference]: Without dead ends: 33068 [2019-12-27 16:25:27,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33068 states. [2019-12-27 16:25:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33068 to 33068. [2019-12-27 16:25:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-27 16:25:27,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 106908 transitions. [2019-12-27 16:25:27,717 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 106908 transitions. Word has length 13 [2019-12-27 16:25:27,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:27,717 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 106908 transitions. [2019-12-27 16:25:27,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 106908 transitions. [2019-12-27 16:25:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:25:27,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:27,721 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:27,721 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:27,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1174763718, now seen corresponding path program 1 times [2019-12-27 16:25:27,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:27,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240495655] [2019-12-27 16:25:27,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:27,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240495655] [2019-12-27 16:25:27,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:27,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:27,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2024350042] [2019-12-27 16:25:27,850 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:27,853 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:27,856 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 16:25:27,856 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:27,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:27,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:27,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:27,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:27,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:27,858 INFO L87 Difference]: Start difference. First operand 33068 states and 106908 transitions. Second operand 5 states. [2019-12-27 16:25:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:29,197 INFO L93 Difference]: Finished difference Result 45410 states and 145082 transitions. [2019-12-27 16:25:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:25:29,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:25:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:29,276 INFO L225 Difference]: With dead ends: 45410 [2019-12-27 16:25:29,276 INFO L226 Difference]: Without dead ends: 45410 [2019-12-27 16:25:29,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45410 states. [2019-12-27 16:25:30,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45410 to 38207. [2019-12-27 16:25:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38207 states. [2019-12-27 16:25:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38207 states to 38207 states and 123094 transitions. [2019-12-27 16:25:30,095 INFO L78 Accepts]: Start accepts. Automaton has 38207 states and 123094 transitions. Word has length 16 [2019-12-27 16:25:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:30,096 INFO L462 AbstractCegarLoop]: Abstraction has 38207 states and 123094 transitions. [2019-12-27 16:25:30,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 38207 states and 123094 transitions. [2019-12-27 16:25:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 16:25:30,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:30,107 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:30,107 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -219431606, now seen corresponding path program 1 times [2019-12-27 16:25:30,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:30,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239398478] [2019-12-27 16:25:30,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:30,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239398478] [2019-12-27 16:25:30,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:30,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:30,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2044718605] [2019-12-27 16:25:30,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:30,212 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:30,219 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 16:25:30,220 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:30,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:30,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:25:30,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:25:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:30,258 INFO L87 Difference]: Start difference. First operand 38207 states and 123094 transitions. Second operand 7 states. [2019-12-27 16:25:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:31,804 INFO L93 Difference]: Finished difference Result 56872 states and 178934 transitions. [2019-12-27 16:25:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:25:31,804 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 16:25:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:31,930 INFO L225 Difference]: With dead ends: 56872 [2019-12-27 16:25:31,931 INFO L226 Difference]: Without dead ends: 56865 [2019-12-27 16:25:31,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:25:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56865 states. [2019-12-27 16:25:32,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56865 to 38602. [2019-12-27 16:25:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38602 states. [2019-12-27 16:25:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38602 states to 38602 states and 123793 transitions. [2019-12-27 16:25:32,817 INFO L78 Accepts]: Start accepts. Automaton has 38602 states and 123793 transitions. Word has length 22 [2019-12-27 16:25:32,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:32,817 INFO L462 AbstractCegarLoop]: Abstraction has 38602 states and 123793 transitions. [2019-12-27 16:25:32,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:25:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 38602 states and 123793 transitions. [2019-12-27 16:25:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 16:25:32,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:32,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:32,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:32,832 INFO L82 PathProgramCache]: Analyzing trace with hash -2132778958, now seen corresponding path program 1 times [2019-12-27 16:25:32,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:32,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473141664] [2019-12-27 16:25:32,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:32,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:32,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473141664] [2019-12-27 16:25:32,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:32,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:32,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1663673863] [2019-12-27 16:25:32,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:32,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:32,907 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 16:25:32,907 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:32,921 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:32,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:32,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:32,923 INFO L87 Difference]: Start difference. First operand 38602 states and 123793 transitions. Second operand 5 states. [2019-12-27 16:25:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:33,012 INFO L93 Difference]: Finished difference Result 16014 states and 48574 transitions. [2019-12-27 16:25:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:25:33,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 16:25:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:33,037 INFO L225 Difference]: With dead ends: 16014 [2019-12-27 16:25:33,037 INFO L226 Difference]: Without dead ends: 16014 [2019-12-27 16:25:33,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16014 states. [2019-12-27 16:25:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16014 to 15686. [2019-12-27 16:25:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15686 states. [2019-12-27 16:25:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15686 states to 15686 states and 47638 transitions. [2019-12-27 16:25:33,748 INFO L78 Accepts]: Start accepts. Automaton has 15686 states and 47638 transitions. Word has length 25 [2019-12-27 16:25:33,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:33,748 INFO L462 AbstractCegarLoop]: Abstraction has 15686 states and 47638 transitions. [2019-12-27 16:25:33,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 15686 states and 47638 transitions. [2019-12-27 16:25:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 16:25:33,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:33,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:33,761 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:33,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:33,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1790545903, now seen corresponding path program 1 times [2019-12-27 16:25:33,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:33,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763982548] [2019-12-27 16:25:33,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:33,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763982548] [2019-12-27 16:25:33,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:33,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:33,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1683519355] [2019-12-27 16:25:33,853 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:33,858 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:33,864 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 16:25:33,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:33,864 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:33,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:25:33,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:33,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:25:33,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:33,865 INFO L87 Difference]: Start difference. First operand 15686 states and 47638 transitions. Second operand 6 states. [2019-12-27 16:25:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:34,457 INFO L93 Difference]: Finished difference Result 22624 states and 66983 transitions. [2019-12-27 16:25:34,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:25:34,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 16:25:34,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:34,489 INFO L225 Difference]: With dead ends: 22624 [2019-12-27 16:25:34,489 INFO L226 Difference]: Without dead ends: 22624 [2019-12-27 16:25:34,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:25:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22624 states. [2019-12-27 16:25:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22624 to 18003. [2019-12-27 16:25:34,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18003 states. [2019-12-27 16:25:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18003 states to 18003 states and 54460 transitions. [2019-12-27 16:25:34,794 INFO L78 Accepts]: Start accepts. Automaton has 18003 states and 54460 transitions. Word has length 27 [2019-12-27 16:25:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:34,794 INFO L462 AbstractCegarLoop]: Abstraction has 18003 states and 54460 transitions. [2019-12-27 16:25:34,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:25:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18003 states and 54460 transitions. [2019-12-27 16:25:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 16:25:34,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:34,812 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:34,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:34,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash -718999585, now seen corresponding path program 1 times [2019-12-27 16:25:34,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:34,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181335540] [2019-12-27 16:25:34,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:34,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-27 16:25:34,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181335540] [2019-12-27 16:25:34,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:34,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:25:34,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002146979] [2019-12-27 16:25:34,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:34,908 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:34,920 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 16:25:34,921 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:34,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:25:34,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 16:25:34,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:34,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 16:25:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:25:34,948 INFO L87 Difference]: Start difference. First operand 18003 states and 54460 transitions. Second operand 8 states. [2019-12-27 16:25:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:36,158 INFO L93 Difference]: Finished difference Result 24689 states and 72792 transitions. [2019-12-27 16:25:36,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:25:36,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 16:25:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:36,192 INFO L225 Difference]: With dead ends: 24689 [2019-12-27 16:25:36,192 INFO L226 Difference]: Without dead ends: 24689 [2019-12-27 16:25:36,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:25:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24689 states. [2019-12-27 16:25:36,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24689 to 16556. [2019-12-27 16:25:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16556 states. [2019-12-27 16:25:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16556 states to 16556 states and 50149 transitions. [2019-12-27 16:25:36,884 INFO L78 Accepts]: Start accepts. Automaton has 16556 states and 50149 transitions. Word has length 33 [2019-12-27 16:25:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:36,884 INFO L462 AbstractCegarLoop]: Abstraction has 16556 states and 50149 transitions. [2019-12-27 16:25:36,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 16:25:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16556 states and 50149 transitions. [2019-12-27 16:25:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 16:25:36,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:36,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:36,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1488715022, now seen corresponding path program 1 times [2019-12-27 16:25:36,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:36,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905890143] [2019-12-27 16:25:36,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:36,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905890143] [2019-12-27 16:25:36,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:36,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:25:36,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [757070122] [2019-12-27 16:25:37,000 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:37,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:37,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 211 transitions. [2019-12-27 16:25:37,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:37,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:25:37,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:37,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:37,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:37,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:37,053 INFO L87 Difference]: Start difference. First operand 16556 states and 50149 transitions. Second operand 3 states. [2019-12-27 16:25:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:37,184 INFO L93 Difference]: Finished difference Result 31245 states and 94721 transitions. [2019-12-27 16:25:37,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:37,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 16:25:37,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:37,218 INFO L225 Difference]: With dead ends: 31245 [2019-12-27 16:25:37,218 INFO L226 Difference]: Without dead ends: 17019 [2019-12-27 16:25:37,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17019 states. [2019-12-27 16:25:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17019 to 16954. [2019-12-27 16:25:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-27 16:25:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50123 transitions. [2019-12-27 16:25:37,489 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50123 transitions. Word has length 39 [2019-12-27 16:25:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:37,489 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50123 transitions. [2019-12-27 16:25:37,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50123 transitions. [2019-12-27 16:25:37,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:25:37,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:37,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:37,511 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:37,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1258899919, now seen corresponding path program 1 times [2019-12-27 16:25:37,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:37,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599873075] [2019-12-27 16:25:37,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:37,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599873075] [2019-12-27 16:25:37,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:37,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:37,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1019636237] [2019-12-27 16:25:37,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:37,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:37,615 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 164 transitions. [2019-12-27 16:25:37,615 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:37,630 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:25:37,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:37,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:37,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:37,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:37,631 INFO L87 Difference]: Start difference. First operand 16954 states and 50123 transitions. Second operand 5 states. [2019-12-27 16:25:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:37,775 INFO L93 Difference]: Finished difference Result 24032 states and 72414 transitions. [2019-12-27 16:25:37,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:25:37,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 16:25:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:37,794 INFO L225 Difference]: With dead ends: 24032 [2019-12-27 16:25:37,794 INFO L226 Difference]: Without dead ends: 10093 [2019-12-27 16:25:37,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2019-12-27 16:25:37,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 10019. [2019-12-27 16:25:37,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10019 states. [2019-12-27 16:25:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10019 states to 10019 states and 28985 transitions. [2019-12-27 16:25:37,963 INFO L78 Accepts]: Start accepts. Automaton has 10019 states and 28985 transitions. Word has length 40 [2019-12-27 16:25:37,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:37,963 INFO L462 AbstractCegarLoop]: Abstraction has 10019 states and 28985 transitions. [2019-12-27 16:25:37,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 10019 states and 28985 transitions. [2019-12-27 16:25:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 16:25:37,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:37,976 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:37,977 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:37,977 INFO L82 PathProgramCache]: Analyzing trace with hash -328554267, now seen corresponding path program 2 times [2019-12-27 16:25:37,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:37,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73885314] [2019-12-27 16:25:37,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:38,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73885314] [2019-12-27 16:25:38,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:38,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:25:38,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132698897] [2019-12-27 16:25:38,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:38,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:38,126 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 203 states and 424 transitions. [2019-12-27 16:25:38,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:38,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:25:38,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:25:38,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:38,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:25:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:38,184 INFO L87 Difference]: Start difference. First operand 10019 states and 28985 transitions. Second operand 7 states. [2019-12-27 16:25:38,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:38,251 INFO L93 Difference]: Finished difference Result 9224 states and 27210 transitions. [2019-12-27 16:25:38,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:25:38,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 16:25:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:38,265 INFO L225 Difference]: With dead ends: 9224 [2019-12-27 16:25:38,265 INFO L226 Difference]: Without dead ends: 6480 [2019-12-27 16:25:38,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:25:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6480 states. [2019-12-27 16:25:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6480 to 6480. [2019-12-27 16:25:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6480 states. [2019-12-27 16:25:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6480 states to 6480 states and 20925 transitions. [2019-12-27 16:25:38,439 INFO L78 Accepts]: Start accepts. Automaton has 6480 states and 20925 transitions. Word has length 40 [2019-12-27 16:25:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:38,439 INFO L462 AbstractCegarLoop]: Abstraction has 6480 states and 20925 transitions. [2019-12-27 16:25:38,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:25:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6480 states and 20925 transitions. [2019-12-27 16:25:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:38,451 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:38,451 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:38,451 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:38,452 INFO L82 PathProgramCache]: Analyzing trace with hash -195559637, now seen corresponding path program 1 times [2019-12-27 16:25:38,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:38,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824699304] [2019-12-27 16:25:38,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:38,518 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824699304] [2019-12-27 16:25:38,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:38,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:25:38,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1621094333] [2019-12-27 16:25:38,519 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:38,541 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:39,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 249 states and 464 transitions. [2019-12-27 16:25:39,052 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:39,075 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:25:39,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:25:39,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:39,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:25:39,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:39,076 INFO L87 Difference]: Start difference. First operand 6480 states and 20925 transitions. Second operand 3 states. [2019-12-27 16:25:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:39,137 INFO L93 Difference]: Finished difference Result 9612 states and 30454 transitions. [2019-12-27 16:25:39,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:25:39,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:25:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:39,150 INFO L225 Difference]: With dead ends: 9612 [2019-12-27 16:25:39,151 INFO L226 Difference]: Without dead ends: 9612 [2019-12-27 16:25:39,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:25:39,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9612 states. [2019-12-27 16:25:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9612 to 7416. [2019-12-27 16:25:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7416 states. [2019-12-27 16:25:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7416 states to 7416 states and 23733 transitions. [2019-12-27 16:25:39,291 INFO L78 Accepts]: Start accepts. Automaton has 7416 states and 23733 transitions. Word has length 64 [2019-12-27 16:25:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:39,292 INFO L462 AbstractCegarLoop]: Abstraction has 7416 states and 23733 transitions. [2019-12-27 16:25:39,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:25:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 7416 states and 23733 transitions. [2019-12-27 16:25:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:39,300 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:39,300 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:39,300 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:39,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1426110435, now seen corresponding path program 1 times [2019-12-27 16:25:39,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:39,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364783445] [2019-12-27 16:25:39,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:39,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:39,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364783445] [2019-12-27 16:25:39,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:39,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:39,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1479917864] [2019-12-27 16:25:39,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:39,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:39,657 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 635 transitions. [2019-12-27 16:25:39,657 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:39,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:25:39,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:39,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:39,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:39,880 INFO L87 Difference]: Start difference. First operand 7416 states and 23733 transitions. Second operand 13 states. [2019-12-27 16:25:40,612 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-27 16:25:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:41,858 INFO L93 Difference]: Finished difference Result 22388 states and 69098 transitions. [2019-12-27 16:25:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:25:41,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:41,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:41,884 INFO L225 Difference]: With dead ends: 22388 [2019-12-27 16:25:41,885 INFO L226 Difference]: Without dead ends: 16774 [2019-12-27 16:25:41,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:25:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16774 states. [2019-12-27 16:25:42,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16774 to 9096. [2019-12-27 16:25:42,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9096 states. [2019-12-27 16:25:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9096 states to 9096 states and 28970 transitions. [2019-12-27 16:25:42,098 INFO L78 Accepts]: Start accepts. Automaton has 9096 states and 28970 transitions. Word has length 64 [2019-12-27 16:25:42,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:42,098 INFO L462 AbstractCegarLoop]: Abstraction has 9096 states and 28970 transitions. [2019-12-27 16:25:42,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:42,098 INFO L276 IsEmpty]: Start isEmpty. Operand 9096 states and 28970 transitions. [2019-12-27 16:25:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:42,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:42,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:42,108 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1226826331, now seen corresponding path program 2 times [2019-12-27 16:25:42,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:42,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201860387] [2019-12-27 16:25:42,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:42,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201860387] [2019-12-27 16:25:42,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:42,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:42,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2094898274] [2019-12-27 16:25:42,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:42,220 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:42,637 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 348 states and 697 transitions. [2019-12-27 16:25:42,637 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:42,859 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 24 times. [2019-12-27 16:25:42,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:42,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:42,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:42,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:42,860 INFO L87 Difference]: Start difference. First operand 9096 states and 28970 transitions. Second operand 13 states. [2019-12-27 16:25:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:43,361 INFO L93 Difference]: Finished difference Result 16709 states and 52072 transitions. [2019-12-27 16:25:43,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:25:43,361 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:43,380 INFO L225 Difference]: With dead ends: 16709 [2019-12-27 16:25:43,381 INFO L226 Difference]: Without dead ends: 12623 [2019-12-27 16:25:43,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-12-27 16:25:43,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12623 states. [2019-12-27 16:25:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12623 to 10382. [2019-12-27 16:25:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10382 states. [2019-12-27 16:25:43,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10382 states to 10382 states and 32866 transitions. [2019-12-27 16:25:43,901 INFO L78 Accepts]: Start accepts. Automaton has 10382 states and 32866 transitions. Word has length 64 [2019-12-27 16:25:43,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:43,902 INFO L462 AbstractCegarLoop]: Abstraction has 10382 states and 32866 transitions. [2019-12-27 16:25:43,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:43,902 INFO L276 IsEmpty]: Start isEmpty. Operand 10382 states and 32866 transitions. [2019-12-27 16:25:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:43,912 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:43,913 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:43,913 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2098893209, now seen corresponding path program 3 times [2019-12-27 16:25:43,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:43,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41604313] [2019-12-27 16:25:43,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:44,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:44,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41604313] [2019-12-27 16:25:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:44,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:25:44,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1965039171] [2019-12-27 16:25:44,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:44,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:44,461 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 332 states and 662 transitions. [2019-12-27 16:25:44,461 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:44,739 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 16:25:44,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:44,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:44,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:44,740 INFO L87 Difference]: Start difference. First operand 10382 states and 32866 transitions. Second operand 13 states. [2019-12-27 16:25:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:47,519 INFO L93 Difference]: Finished difference Result 51743 states and 159088 transitions. [2019-12-27 16:25:47,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-27 16:25:47,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:47,576 INFO L225 Difference]: With dead ends: 51743 [2019-12-27 16:25:47,576 INFO L226 Difference]: Without dead ends: 38901 [2019-12-27 16:25:47,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 17 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=771, Invalid=2535, Unknown=0, NotChecked=0, Total=3306 [2019-12-27 16:25:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38901 states. [2019-12-27 16:25:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38901 to 12885. [2019-12-27 16:25:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12885 states. [2019-12-27 16:25:48,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12885 states to 12885 states and 40786 transitions. [2019-12-27 16:25:48,341 INFO L78 Accepts]: Start accepts. Automaton has 12885 states and 40786 transitions. Word has length 64 [2019-12-27 16:25:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:48,342 INFO L462 AbstractCegarLoop]: Abstraction has 12885 states and 40786 transitions. [2019-12-27 16:25:48,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 12885 states and 40786 transitions. [2019-12-27 16:25:48,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:48,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:48,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:48,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:48,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:48,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1413769055, now seen corresponding path program 4 times [2019-12-27 16:25:48,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:48,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512090313] [2019-12-27 16:25:48,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:48,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:48,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512090313] [2019-12-27 16:25:48,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:48,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:25:48,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [442935683] [2019-12-27 16:25:48,438 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:48,458 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:48,726 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 322 states and 631 transitions. [2019-12-27 16:25:48,726 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:48,775 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 16:25:48,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:25:48,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:48,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:25:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:25:48,776 INFO L87 Difference]: Start difference. First operand 12885 states and 40786 transitions. Second operand 5 states. [2019-12-27 16:25:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:49,033 INFO L93 Difference]: Finished difference Result 14570 states and 45489 transitions. [2019-12-27 16:25:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:25:49,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-12-27 16:25:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:49,055 INFO L225 Difference]: With dead ends: 14570 [2019-12-27 16:25:49,055 INFO L226 Difference]: Without dead ends: 14570 [2019-12-27 16:25:49,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:25:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14570 states. [2019-12-27 16:25:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14570 to 13816. [2019-12-27 16:25:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13816 states. [2019-12-27 16:25:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13816 states to 13816 states and 43407 transitions. [2019-12-27 16:25:49,278 INFO L78 Accepts]: Start accepts. Automaton has 13816 states and 43407 transitions. Word has length 64 [2019-12-27 16:25:49,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:49,278 INFO L462 AbstractCegarLoop]: Abstraction has 13816 states and 43407 transitions. [2019-12-27 16:25:49,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:25:49,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13816 states and 43407 transitions. [2019-12-27 16:25:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:49,297 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:49,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:49,297 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:49,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:49,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1714079827, now seen corresponding path program 5 times [2019-12-27 16:25:49,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:49,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147923604] [2019-12-27 16:25:49,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:49,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147923604] [2019-12-27 16:25:49,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:49,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:49,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [785075793] [2019-12-27 16:25:49,389 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:49,409 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:49,923 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 262 states and 484 transitions. [2019-12-27 16:25:49,923 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:50,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:50,111 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:25:50,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:25:50,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:25:50,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:25:50,112 INFO L87 Difference]: Start difference. First operand 13816 states and 43407 transitions. Second operand 10 states. [2019-12-27 16:25:51,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:51,630 INFO L93 Difference]: Finished difference Result 28514 states and 86570 transitions. [2019-12-27 16:25:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 16:25:51,631 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 16:25:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:51,671 INFO L225 Difference]: With dead ends: 28514 [2019-12-27 16:25:51,671 INFO L226 Difference]: Without dead ends: 28346 [2019-12-27 16:25:51,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-12-27 16:25:51,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28346 states. [2019-12-27 16:25:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28346 to 20759. [2019-12-27 16:25:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20759 states. [2019-12-27 16:25:52,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20759 states to 20759 states and 63630 transitions. [2019-12-27 16:25:52,036 INFO L78 Accepts]: Start accepts. Automaton has 20759 states and 63630 transitions. Word has length 64 [2019-12-27 16:25:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:52,036 INFO L462 AbstractCegarLoop]: Abstraction has 20759 states and 63630 transitions. [2019-12-27 16:25:52,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:25:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 20759 states and 63630 transitions. [2019-12-27 16:25:52,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:52,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:52,057 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:52,057 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:52,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 768567647, now seen corresponding path program 6 times [2019-12-27 16:25:52,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:52,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951145282] [2019-12-27 16:25:52,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:52,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951145282] [2019-12-27 16:25:52,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:25:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [94569859] [2019-12-27 16:25:52,148 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:52,166 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:52,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 265 states and 464 transitions. [2019-12-27 16:25:52,750 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:52,937 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 16:25:52,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:25:52,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:25:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:25:52,939 INFO L87 Difference]: Start difference. First operand 20759 states and 63630 transitions. Second operand 13 states. [2019-12-27 16:25:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:25:56,764 INFO L93 Difference]: Finished difference Result 76185 states and 227873 transitions. [2019-12-27 16:25:56,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 16:25:56,764 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:25:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:25:56,877 INFO L225 Difference]: With dead ends: 76185 [2019-12-27 16:25:56,877 INFO L226 Difference]: Without dead ends: 75965 [2019-12-27 16:25:56,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 16:25:57,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75965 states. [2019-12-27 16:25:58,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75965 to 30489. [2019-12-27 16:25:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30489 states. [2019-12-27 16:25:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30489 states to 30489 states and 93911 transitions. [2019-12-27 16:25:58,320 INFO L78 Accepts]: Start accepts. Automaton has 30489 states and 93911 transitions. Word has length 64 [2019-12-27 16:25:58,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:25:58,320 INFO L462 AbstractCegarLoop]: Abstraction has 30489 states and 93911 transitions. [2019-12-27 16:25:58,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:25:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 30489 states and 93911 transitions. [2019-12-27 16:25:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:25:58,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:25:58,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:25:58,359 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:25:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:25:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 908702963, now seen corresponding path program 7 times [2019-12-27 16:25:58,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:25:58,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402205056] [2019-12-27 16:25:58,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:25:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:25:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:25:58,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402205056] [2019-12-27 16:25:58,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:25:58,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:25:58,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1989901005] [2019-12-27 16:25:58,469 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:25:58,488 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:25:58,699 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 446 transitions. [2019-12-27 16:25:58,699 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:25:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:58,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:25:58,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:25:58,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:25:58,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:25:58,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:25:58,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:25:58,835 INFO L87 Difference]: Start difference. First operand 30489 states and 93911 transitions. Second operand 11 states. [2019-12-27 16:26:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:01,653 INFO L93 Difference]: Finished difference Result 41936 states and 127638 transitions. [2019-12-27 16:26:01,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 16:26:01,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:26:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:01,715 INFO L225 Difference]: With dead ends: 41936 [2019-12-27 16:26:01,715 INFO L226 Difference]: Without dead ends: 41936 [2019-12-27 16:26:01,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2019-12-27 16:26:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41936 states. [2019-12-27 16:26:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41936 to 33078. [2019-12-27 16:26:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33078 states. [2019-12-27 16:26:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33078 states to 33078 states and 101261 transitions. [2019-12-27 16:26:02,752 INFO L78 Accepts]: Start accepts. Automaton has 33078 states and 101261 transitions. Word has length 64 [2019-12-27 16:26:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:02,753 INFO L462 AbstractCegarLoop]: Abstraction has 33078 states and 101261 transitions. [2019-12-27 16:26:02,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:26:02,753 INFO L276 IsEmpty]: Start isEmpty. Operand 33078 states and 101261 transitions. [2019-12-27 16:26:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:02,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:02,790 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:02,790 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:02,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1398237635, now seen corresponding path program 8 times [2019-12-27 16:26:02,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:02,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701118887] [2019-12-27 16:26:02,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:02,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701118887] [2019-12-27 16:26:02,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:02,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:02,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1575206211] [2019-12-27 16:26:02,909 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:02,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:03,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 244 states and 429 transitions. [2019-12-27 16:26:03,138 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:03,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 16:26:03,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:26:03,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:03,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:26:03,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:26:03,304 INFO L87 Difference]: Start difference. First operand 33078 states and 101261 transitions. Second operand 13 states. [2019-12-27 16:26:06,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:06,068 INFO L93 Difference]: Finished difference Result 66809 states and 200105 transitions. [2019-12-27 16:26:06,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:06,068 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-27 16:26:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:06,167 INFO L225 Difference]: With dead ends: 66809 [2019-12-27 16:26:06,168 INFO L226 Difference]: Without dead ends: 66809 [2019-12-27 16:26:06,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:26:06,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66809 states. [2019-12-27 16:26:07,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66809 to 33639. [2019-12-27 16:26:07,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33639 states. [2019-12-27 16:26:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33639 states to 33639 states and 102897 transitions. [2019-12-27 16:26:07,531 INFO L78 Accepts]: Start accepts. Automaton has 33639 states and 102897 transitions. Word has length 64 [2019-12-27 16:26:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:07,531 INFO L462 AbstractCegarLoop]: Abstraction has 33639 states and 102897 transitions. [2019-12-27 16:26:07,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:26:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 33639 states and 102897 transitions. [2019-12-27 16:26:07,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:07,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:07,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:07,566 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:07,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:07,566 INFO L82 PathProgramCache]: Analyzing trace with hash 130546237, now seen corresponding path program 9 times [2019-12-27 16:26:07,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:07,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321564723] [2019-12-27 16:26:07,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:07,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321564723] [2019-12-27 16:26:07,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:07,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [960225470] [2019-12-27 16:26:07,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:07,671 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:07,851 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 217 states and 356 transitions. [2019-12-27 16:26:07,851 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:07,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:08,030 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 16:26:08,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:26:08,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:08,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:26:08,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:26:08,032 INFO L87 Difference]: Start difference. First operand 33639 states and 102897 transitions. Second operand 11 states. [2019-12-27 16:26:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:11,130 INFO L93 Difference]: Finished difference Result 88541 states and 267291 transitions. [2019-12-27 16:26:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 16:26:11,131 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:26:11,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:11,262 INFO L225 Difference]: With dead ends: 88541 [2019-12-27 16:26:11,262 INFO L226 Difference]: Without dead ends: 88541 [2019-12-27 16:26:11,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:26:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88541 states. [2019-12-27 16:26:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88541 to 36575. [2019-12-27 16:26:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36575 states. [2019-12-27 16:26:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36575 states to 36575 states and 111901 transitions. [2019-12-27 16:26:12,221 INFO L78 Accepts]: Start accepts. Automaton has 36575 states and 111901 transitions. Word has length 64 [2019-12-27 16:26:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 36575 states and 111901 transitions. [2019-12-27 16:26:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:26:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 36575 states and 111901 transitions. [2019-12-27 16:26:12,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:12,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:12,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:12,262 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:12,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:12,262 INFO L82 PathProgramCache]: Analyzing trace with hash -789321411, now seen corresponding path program 10 times [2019-12-27 16:26:12,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:12,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528143101] [2019-12-27 16:26:12,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:12,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528143101] [2019-12-27 16:26:12,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:12,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:12,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1024612713] [2019-12-27 16:26:12,375 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:12,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:12,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 404 transitions. [2019-12-27 16:26:12,675 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:12,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:12,851 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 16:26:12,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 16:26:12,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:12,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 16:26:12,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:26:12,852 INFO L87 Difference]: Start difference. First operand 36575 states and 111901 transitions. Second operand 12 states. [2019-12-27 16:26:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:16,014 INFO L93 Difference]: Finished difference Result 87710 states and 264759 transitions. [2019-12-27 16:26:16,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 16:26:16,015 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-12-27 16:26:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:16,145 INFO L225 Difference]: With dead ends: 87710 [2019-12-27 16:26:16,145 INFO L226 Difference]: Without dead ends: 87710 [2019-12-27 16:26:16,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-12-27 16:26:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87710 states. [2019-12-27 16:26:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87710 to 34451. [2019-12-27 16:26:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34451 states. [2019-12-27 16:26:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34451 states to 34451 states and 105367 transitions. [2019-12-27 16:26:17,118 INFO L78 Accepts]: Start accepts. Automaton has 34451 states and 105367 transitions. Word has length 64 [2019-12-27 16:26:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:17,118 INFO L462 AbstractCegarLoop]: Abstraction has 34451 states and 105367 transitions. [2019-12-27 16:26:17,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 16:26:17,118 INFO L276 IsEmpty]: Start isEmpty. Operand 34451 states and 105367 transitions. [2019-12-27 16:26:17,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:17,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:17,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:17,154 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:17,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1935640731, now seen corresponding path program 11 times [2019-12-27 16:26:17,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:17,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651360977] [2019-12-27 16:26:17,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:17,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651360977] [2019-12-27 16:26:17,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:17,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:17,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [5107086] [2019-12-27 16:26:17,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:17,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:17,488 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 213 states and 349 transitions. [2019-12-27 16:26:17,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:17,591 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:26:17,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:26:17,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:26:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:26:17,592 INFO L87 Difference]: Start difference. First operand 34451 states and 105367 transitions. Second operand 9 states. [2019-12-27 16:26:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:19,466 INFO L93 Difference]: Finished difference Result 47402 states and 143254 transitions. [2019-12-27 16:26:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:26:19,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 16:26:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:19,533 INFO L225 Difference]: With dead ends: 47402 [2019-12-27 16:26:19,533 INFO L226 Difference]: Without dead ends: 47162 [2019-12-27 16:26:19,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 16:26:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47162 states. [2019-12-27 16:26:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47162 to 34744. [2019-12-27 16:26:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34744 states. [2019-12-27 16:26:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34744 states to 34744 states and 106103 transitions. [2019-12-27 16:26:20,154 INFO L78 Accepts]: Start accepts. Automaton has 34744 states and 106103 transitions. Word has length 64 [2019-12-27 16:26:20,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:20,155 INFO L462 AbstractCegarLoop]: Abstraction has 34744 states and 106103 transitions. [2019-12-27 16:26:20,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:26:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34744 states and 106103 transitions. [2019-12-27 16:26:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:20,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:20,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:20,190 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1015773083, now seen corresponding path program 12 times [2019-12-27 16:26:20,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:20,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548096991] [2019-12-27 16:26:20,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:20,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548096991] [2019-12-27 16:26:20,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:20,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:20,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [693991379] [2019-12-27 16:26:20,288 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:20,305 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:20,515 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 442 transitions. [2019-12-27 16:26:20,515 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:20,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:20,663 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:26:20,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:26:20,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:20,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:26:20,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:26:20,665 INFO L87 Difference]: Start difference. First operand 34744 states and 106103 transitions. Second operand 10 states. [2019-12-27 16:26:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:22,768 INFO L93 Difference]: Finished difference Result 46340 states and 140125 transitions. [2019-12-27 16:26:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 16:26:22,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-27 16:26:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:22,835 INFO L225 Difference]: With dead ends: 46340 [2019-12-27 16:26:22,835 INFO L226 Difference]: Without dead ends: 46340 [2019-12-27 16:26:22,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:26:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46340 states. [2019-12-27 16:26:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46340 to 34126. [2019-12-27 16:26:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34126 states. [2019-12-27 16:26:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34126 states to 34126 states and 104292 transitions. [2019-12-27 16:26:23,713 INFO L78 Accepts]: Start accepts. Automaton has 34126 states and 104292 transitions. Word has length 64 [2019-12-27 16:26:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:23,714 INFO L462 AbstractCegarLoop]: Abstraction has 34126 states and 104292 transitions. [2019-12-27 16:26:23,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:26:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 34126 states and 104292 transitions. [2019-12-27 16:26:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:23,750 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:23,750 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:23,751 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:23,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:23,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1742611803, now seen corresponding path program 13 times [2019-12-27 16:26:23,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:23,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802995072] [2019-12-27 16:26:23,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:23,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:23,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802995072] [2019-12-27 16:26:23,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:23,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:26:23,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [916640654] [2019-12-27 16:26:23,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:23,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:24,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 218 states and 356 transitions. [2019-12-27 16:26:24,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:24,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 16:26:24,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:24,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:24,043 INFO L87 Difference]: Start difference. First operand 34126 states and 104292 transitions. Second operand 6 states. [2019-12-27 16:26:24,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:24,511 INFO L93 Difference]: Finished difference Result 36069 states and 109509 transitions. [2019-12-27 16:26:24,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:26:24,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 16:26:24,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:24,563 INFO L225 Difference]: With dead ends: 36069 [2019-12-27 16:26:24,563 INFO L226 Difference]: Without dead ends: 36069 [2019-12-27 16:26:24,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:26:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36069 states. [2019-12-27 16:26:25,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36069 to 34100. [2019-12-27 16:26:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34100 states. [2019-12-27 16:26:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34100 states to 34100 states and 104219 transitions. [2019-12-27 16:26:25,115 INFO L78 Accepts]: Start accepts. Automaton has 34100 states and 104219 transitions. Word has length 64 [2019-12-27 16:26:25,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:25,115 INFO L462 AbstractCegarLoop]: Abstraction has 34100 states and 104219 transitions. [2019-12-27 16:26:25,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 34100 states and 104219 transitions. [2019-12-27 16:26:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:25,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:25,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:25,152 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:25,152 INFO L82 PathProgramCache]: Analyzing trace with hash 655648471, now seen corresponding path program 14 times [2019-12-27 16:26:25,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:25,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869038174] [2019-12-27 16:26:25,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:25,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869038174] [2019-12-27 16:26:25,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:25,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:25,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1939993487] [2019-12-27 16:26:25,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:25,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:25,740 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 269 states and 445 transitions. [2019-12-27 16:26:25,740 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:25,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:25,873 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 16:26:25,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 16:26:25,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:25,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 16:26:25,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:26:25,874 INFO L87 Difference]: Start difference. First operand 34100 states and 104219 transitions. Second operand 11 states. [2019-12-27 16:26:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:27,964 INFO L93 Difference]: Finished difference Result 84273 states and 252632 transitions. [2019-12-27 16:26:27,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:27,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 16:26:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:28,095 INFO L225 Difference]: With dead ends: 84273 [2019-12-27 16:26:28,095 INFO L226 Difference]: Without dead ends: 84049 [2019-12-27 16:26:28,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:26:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84049 states. [2019-12-27 16:26:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84049 to 38967. [2019-12-27 16:26:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38967 states. [2019-12-27 16:26:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38967 states to 38967 states and 118776 transitions. [2019-12-27 16:26:29,126 INFO L78 Accepts]: Start accepts. Automaton has 38967 states and 118776 transitions. Word has length 64 [2019-12-27 16:26:29,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:29,126 INFO L462 AbstractCegarLoop]: Abstraction has 38967 states and 118776 transitions. [2019-12-27 16:26:29,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 16:26:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 38967 states and 118776 transitions. [2019-12-27 16:26:29,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 16:26:29,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:29,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:29,171 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:29,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1300584189, now seen corresponding path program 15 times [2019-12-27 16:26:29,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:29,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303769738] [2019-12-27 16:26:29,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:29,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303769738] [2019-12-27 16:26:29,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:29,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:29,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1966225956] [2019-12-27 16:26:29,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:29,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:29,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 228 states and 382 transitions. [2019-12-27 16:26:29,794 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:29,796 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:26:29,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:26:29,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:29,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:26:29,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:29,797 INFO L87 Difference]: Start difference. First operand 38967 states and 118776 transitions. Second operand 3 states. [2019-12-27 16:26:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:30,032 INFO L93 Difference]: Finished difference Result 38967 states and 118775 transitions. [2019-12-27 16:26:30,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:26:30,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 16:26:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:30,129 INFO L225 Difference]: With dead ends: 38967 [2019-12-27 16:26:30,129 INFO L226 Difference]: Without dead ends: 38967 [2019-12-27 16:26:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:26:30,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38967 states. [2019-12-27 16:26:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38967 to 32748. [2019-12-27 16:26:30,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32748 states. [2019-12-27 16:26:30,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32748 states to 32748 states and 100930 transitions. [2019-12-27 16:26:30,921 INFO L78 Accepts]: Start accepts. Automaton has 32748 states and 100930 transitions. Word has length 64 [2019-12-27 16:26:30,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:30,921 INFO L462 AbstractCegarLoop]: Abstraction has 32748 states and 100930 transitions. [2019-12-27 16:26:30,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:26:30,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32748 states and 100930 transitions. [2019-12-27 16:26:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 16:26:30,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:30,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:30,959 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:30,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2117464962, now seen corresponding path program 1 times [2019-12-27 16:26:30,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:30,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309585593] [2019-12-27 16:26:30,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:30,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:31,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309585593] [2019-12-27 16:26:31,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:31,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:26:31,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2104888513] [2019-12-27 16:26:31,018 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:31,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:31,261 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 466 transitions. [2019-12-27 16:26:31,261 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:31,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:26:31,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:26:31,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:31,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:26:31,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:26:31,299 INFO L87 Difference]: Start difference. First operand 32748 states and 100930 transitions. Second operand 6 states. [2019-12-27 16:26:31,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:31,656 INFO L93 Difference]: Finished difference Result 33503 states and 101978 transitions. [2019-12-27 16:26:31,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:26:31,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 16:26:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:31,704 INFO L225 Difference]: With dead ends: 33503 [2019-12-27 16:26:31,704 INFO L226 Difference]: Without dead ends: 33503 [2019-12-27 16:26:31,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:26:31,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33503 states. [2019-12-27 16:26:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33503 to 24971. [2019-12-27 16:26:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24971 states. [2019-12-27 16:26:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24971 states to 24971 states and 76663 transitions. [2019-12-27 16:26:32,451 INFO L78 Accepts]: Start accepts. Automaton has 24971 states and 76663 transitions. Word has length 65 [2019-12-27 16:26:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 24971 states and 76663 transitions. [2019-12-27 16:26:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:26:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 24971 states and 76663 transitions. [2019-12-27 16:26:32,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:32,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:32,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:32,478 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:32,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:32,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1338482558, now seen corresponding path program 1 times [2019-12-27 16:26:32,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:32,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110712280] [2019-12-27 16:26:32,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:32,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110712280] [2019-12-27 16:26:32,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:32,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 16:26:32,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2069213569] [2019-12-27 16:26:32,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:32,595 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:33,033 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 327 states and 673 transitions. [2019-12-27 16:26:33,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:33,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:33,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:33,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:33,517 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 38 times. [2019-12-27 16:26:33,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:26:33,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:33,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:26:33,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:26:33,518 INFO L87 Difference]: Start difference. First operand 24971 states and 76663 transitions. Second operand 16 states. [2019-12-27 16:26:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:36,355 INFO L93 Difference]: Finished difference Result 41261 states and 125139 transitions. [2019-12-27 16:26:36,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:26:36,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 16:26:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:36,401 INFO L225 Difference]: With dead ends: 41261 [2019-12-27 16:26:36,401 INFO L226 Difference]: Without dead ends: 31135 [2019-12-27 16:26:36,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2019-12-27 16:26:36,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31135 states. [2019-12-27 16:26:36,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31135 to 25650. [2019-12-27 16:26:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25650 states. [2019-12-27 16:26:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25650 states to 25650 states and 78179 transitions. [2019-12-27 16:26:36,852 INFO L78 Accepts]: Start accepts. Automaton has 25650 states and 78179 transitions. Word has length 66 [2019-12-27 16:26:36,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:36,852 INFO L462 AbstractCegarLoop]: Abstraction has 25650 states and 78179 transitions. [2019-12-27 16:26:36,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:26:36,852 INFO L276 IsEmpty]: Start isEmpty. Operand 25650 states and 78179 transitions. [2019-12-27 16:26:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:36,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:36,878 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:36,878 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:36,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1029826500, now seen corresponding path program 2 times [2019-12-27 16:26:36,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:36,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996760071] [2019-12-27 16:26:36,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:36,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:36,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996760071] [2019-12-27 16:26:36,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:36,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:26:36,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1428832909] [2019-12-27 16:26:36,983 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:37,000 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:37,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 504 transitions. [2019-12-27 16:26:37,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:37,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:37,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:37,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:38,039 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 26 times. [2019-12-27 16:26:38,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 16:26:38,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:38,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 16:26:38,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 16:26:38,040 INFO L87 Difference]: Start difference. First operand 25650 states and 78179 transitions. Second operand 16 states. [2019-12-27 16:26:40,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:40,241 INFO L93 Difference]: Finished difference Result 38213 states and 114946 transitions. [2019-12-27 16:26:40,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 16:26:40,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-27 16:26:40,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:40,284 INFO L225 Difference]: With dead ends: 38213 [2019-12-27 16:26:40,285 INFO L226 Difference]: Without dead ends: 28700 [2019-12-27 16:26:40,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=487, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:26:40,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28700 states. [2019-12-27 16:26:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28700 to 25448. [2019-12-27 16:26:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25448 states. [2019-12-27 16:26:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25448 states to 25448 states and 77537 transitions. [2019-12-27 16:26:40,729 INFO L78 Accepts]: Start accepts. Automaton has 25448 states and 77537 transitions. Word has length 66 [2019-12-27 16:26:40,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:40,729 INFO L462 AbstractCegarLoop]: Abstraction has 25448 states and 77537 transitions. [2019-12-27 16:26:40,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 16:26:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 25448 states and 77537 transitions. [2019-12-27 16:26:40,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:40,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:40,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:40,760 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:40,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:40,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1662390436, now seen corresponding path program 3 times [2019-12-27 16:26:40,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:40,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615365573] [2019-12-27 16:26:40,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:40,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615365573] [2019-12-27 16:26:40,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:40,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:26:40,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1261737944] [2019-12-27 16:26:40,922 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:40,937 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:41,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 307 states and 623 transitions. [2019-12-27 16:26:41,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:41,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:41,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:42,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 16:26:42,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:26:42,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:26:42,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:26:42,087 INFO L87 Difference]: Start difference. First operand 25448 states and 77537 transitions. Second operand 22 states. [2019-12-27 16:26:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:26:52,458 INFO L93 Difference]: Finished difference Result 87521 states and 260273 transitions. [2019-12-27 16:26:52,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-27 16:26:52,459 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:26:52,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:26:52,594 INFO L225 Difference]: With dead ends: 87521 [2019-12-27 16:26:52,594 INFO L226 Difference]: Without dead ends: 87521 [2019-12-27 16:26:52,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=639, Invalid=2783, Unknown=0, NotChecked=0, Total=3422 [2019-12-27 16:26:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87521 states. [2019-12-27 16:26:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87521 to 27229. [2019-12-27 16:26:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27229 states. [2019-12-27 16:26:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27229 states to 27229 states and 82795 transitions. [2019-12-27 16:26:53,546 INFO L78 Accepts]: Start accepts. Automaton has 27229 states and 82795 transitions. Word has length 66 [2019-12-27 16:26:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:26:53,546 INFO L462 AbstractCegarLoop]: Abstraction has 27229 states and 82795 transitions. [2019-12-27 16:26:53,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:26:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 27229 states and 82795 transitions. [2019-12-27 16:26:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:26:53,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:26:53,577 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:26:53,577 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:26:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:26:53,577 INFO L82 PathProgramCache]: Analyzing trace with hash -848717318, now seen corresponding path program 4 times [2019-12-27 16:26:53,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:26:53,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484063693] [2019-12-27 16:26:53,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:26:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:26:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:26:53,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484063693] [2019-12-27 16:26:53,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:26:53,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:26:53,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [962397719] [2019-12-27 16:26:53,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:26:53,780 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:26:54,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 243 states and 462 transitions. [2019-12-27 16:26:54,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:26:54,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:54,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:26:54,998 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 43 times. [2019-12-27 16:26:54,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 16:26:54,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:26:54,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 16:26:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:26:55,000 INFO L87 Difference]: Start difference. First operand 27229 states and 82795 transitions. Second operand 23 states. [2019-12-27 16:27:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:05,216 INFO L93 Difference]: Finished difference Result 85435 states and 253248 transitions. [2019-12-27 16:27:05,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 16:27:05,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 66 [2019-12-27 16:27:05,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:05,333 INFO L225 Difference]: With dead ends: 85435 [2019-12-27 16:27:05,333 INFO L226 Difference]: Without dead ends: 85435 [2019-12-27 16:27:05,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=688, Invalid=3344, Unknown=0, NotChecked=0, Total=4032 [2019-12-27 16:27:05,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85435 states. [2019-12-27 16:27:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85435 to 28267. [2019-12-27 16:27:06,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28267 states. [2019-12-27 16:27:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28267 states to 28267 states and 85893 transitions. [2019-12-27 16:27:06,504 INFO L78 Accepts]: Start accepts. Automaton has 28267 states and 85893 transitions. Word has length 66 [2019-12-27 16:27:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:06,504 INFO L462 AbstractCegarLoop]: Abstraction has 28267 states and 85893 transitions. [2019-12-27 16:27:06,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 16:27:06,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28267 states and 85893 transitions. [2019-12-27 16:27:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:06,535 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:06,535 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:06,535 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1124067425, now seen corresponding path program 1 times [2019-12-27 16:27:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789216198] [2019-12-27 16:27:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:06,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789216198] [2019-12-27 16:27:06,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:06,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:27:06,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281173643] [2019-12-27 16:27:06,572 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:06,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:06,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 235 states and 442 transitions. [2019-12-27 16:27:06,834 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:06,843 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:27:06,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:06,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:06,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:06,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:06,844 INFO L87 Difference]: Start difference. First operand 28267 states and 85893 transitions. Second operand 3 states. [2019-12-27 16:27:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:06,957 INFO L93 Difference]: Finished difference Result 30049 states and 89705 transitions. [2019-12-27 16:27:06,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:06,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:27:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:06,997 INFO L225 Difference]: With dead ends: 30049 [2019-12-27 16:27:06,997 INFO L226 Difference]: Without dead ends: 30049 [2019-12-27 16:27:06,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30049 states. [2019-12-27 16:27:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30049 to 19979. [2019-12-27 16:27:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19979 states. [2019-12-27 16:27:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19979 states to 19979 states and 59232 transitions. [2019-12-27 16:27:07,368 INFO L78 Accepts]: Start accepts. Automaton has 19979 states and 59232 transitions. Word has length 66 [2019-12-27 16:27:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:07,369 INFO L462 AbstractCegarLoop]: Abstraction has 19979 states and 59232 transitions. [2019-12-27 16:27:07,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19979 states and 59232 transitions. [2019-12-27 16:27:07,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:07,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:07,388 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:07,388 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:07,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:07,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1940407340, now seen corresponding path program 5 times [2019-12-27 16:27:07,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:07,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489470181] [2019-12-27 16:27:07,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:07,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489470181] [2019-12-27 16:27:07,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:07,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 16:27:07,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [547868045] [2019-12-27 16:27:07,558 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:07,572 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:07,767 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 261 states and 515 transitions. [2019-12-27 16:27:07,767 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:07,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:07,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:08,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:08,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:08,721 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 42 times. [2019-12-27 16:27:08,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-27 16:27:08,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:08,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-27 16:27:08,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-12-27 16:27:08,723 INFO L87 Difference]: Start difference. First operand 19979 states and 59232 transitions. Second operand 24 states. [2019-12-27 16:27:15,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:15,475 INFO L93 Difference]: Finished difference Result 45874 states and 134803 transitions. [2019-12-27 16:27:15,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 16:27:15,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2019-12-27 16:27:15,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:15,538 INFO L225 Difference]: With dead ends: 45874 [2019-12-27 16:27:15,538 INFO L226 Difference]: Without dead ends: 45874 [2019-12-27 16:27:15,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 16:27:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45874 states. [2019-12-27 16:27:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45874 to 19127. [2019-12-27 16:27:16,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19127 states. [2019-12-27 16:27:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19127 states to 19127 states and 56796 transitions. [2019-12-27 16:27:16,040 INFO L78 Accepts]: Start accepts. Automaton has 19127 states and 56796 transitions. Word has length 66 [2019-12-27 16:27:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:16,041 INFO L462 AbstractCegarLoop]: Abstraction has 19127 states and 56796 transitions. [2019-12-27 16:27:16,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-27 16:27:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 19127 states and 56796 transitions. [2019-12-27 16:27:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:16,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:16,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:16,061 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:16,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:16,061 INFO L82 PathProgramCache]: Analyzing trace with hash 312790614, now seen corresponding path program 6 times [2019-12-27 16:27:16,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:16,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648315561] [2019-12-27 16:27:16,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:16,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648315561] [2019-12-27 16:27:16,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:16,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:16,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1195197684] [2019-12-27 16:27:16,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:16,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:16,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 296 states and 570 transitions. [2019-12-27 16:27:16,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:16,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:16,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:16,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:16,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:17,147 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 36 times. [2019-12-27 16:27:17,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:27:17,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:27:17,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:27:17,148 INFO L87 Difference]: Start difference. First operand 19127 states and 56796 transitions. Second operand 22 states. [2019-12-27 16:27:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:20,269 INFO L93 Difference]: Finished difference Result 33391 states and 97968 transitions. [2019-12-27 16:27:20,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 16:27:20,270 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:27:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:20,313 INFO L225 Difference]: With dead ends: 33391 [2019-12-27 16:27:20,313 INFO L226 Difference]: Without dead ends: 27978 [2019-12-27 16:27:20,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 14 SyntacticMatches, 13 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=456, Invalid=2196, Unknown=0, NotChecked=0, Total=2652 [2019-12-27 16:27:20,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27978 states. [2019-12-27 16:27:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27978 to 18307. [2019-12-27 16:27:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18307 states. [2019-12-27 16:27:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18307 states to 18307 states and 54435 transitions. [2019-12-27 16:27:20,704 INFO L78 Accepts]: Start accepts. Automaton has 18307 states and 54435 transitions. Word has length 66 [2019-12-27 16:27:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:20,705 INFO L462 AbstractCegarLoop]: Abstraction has 18307 states and 54435 transitions. [2019-12-27 16:27:20,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:27:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 18307 states and 54435 transitions. [2019-12-27 16:27:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:20,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:20,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:20,726 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:20,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:20,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2048064026, now seen corresponding path program 7 times [2019-12-27 16:27:20,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:20,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799095355] [2019-12-27 16:27:20,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:20,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799095355] [2019-12-27 16:27:20,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:20,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:27:20,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1367113984] [2019-12-27 16:27:20,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:20,901 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:21,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 304 states and 608 transitions. [2019-12-27 16:27:21,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:21,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:21,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:21,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:27:21,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 16:27:21,842 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 39 times. [2019-12-27 16:27:21,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 16:27:21,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 16:27:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-27 16:27:21,843 INFO L87 Difference]: Start difference. First operand 18307 states and 54435 transitions. Second operand 22 states. [2019-12-27 16:27:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:24,662 INFO L93 Difference]: Finished difference Result 21514 states and 63115 transitions. [2019-12-27 16:27:24,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 16:27:24,662 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 66 [2019-12-27 16:27:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:24,692 INFO L225 Difference]: With dead ends: 21514 [2019-12-27 16:27:24,692 INFO L226 Difference]: Without dead ends: 20773 [2019-12-27 16:27:24,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 12 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=869, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 16:27:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20773 states. [2019-12-27 16:27:24,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20773 to 17837. [2019-12-27 16:27:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17837 states. [2019-12-27 16:27:24,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17837 states to 17837 states and 53261 transitions. [2019-12-27 16:27:24,984 INFO L78 Accepts]: Start accepts. Automaton has 17837 states and 53261 transitions. Word has length 66 [2019-12-27 16:27:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:24,984 INFO L462 AbstractCegarLoop]: Abstraction has 17837 states and 53261 transitions. [2019-12-27 16:27:24,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 16:27:24,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17837 states and 53261 transitions. [2019-12-27 16:27:25,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 16:27:25,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:25,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:25,003 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:25,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:25,003 INFO L82 PathProgramCache]: Analyzing trace with hash -124195356, now seen corresponding path program 8 times [2019-12-27 16:27:25,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:25,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77407102] [2019-12-27 16:27:25,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:27:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:27:25,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77407102] [2019-12-27 16:27:25,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:27:25,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:27:25,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58054294] [2019-12-27 16:27:25,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:27:25,188 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:27:25,551 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 533 transitions. [2019-12-27 16:27:25,552 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:27:25,560 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 16:27:25,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:27:25,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:27:25,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:27:25,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:25,562 INFO L87 Difference]: Start difference. First operand 17837 states and 53261 transitions. Second operand 3 states. [2019-12-27 16:27:25,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:27:25,732 INFO L93 Difference]: Finished difference Result 19865 states and 59424 transitions. [2019-12-27 16:27:25,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:27:25,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 16:27:25,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:27:25,775 INFO L225 Difference]: With dead ends: 19865 [2019-12-27 16:27:25,775 INFO L226 Difference]: Without dead ends: 19865 [2019-12-27 16:27:25,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:27:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19865 states. [2019-12-27 16:27:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19865 to 16509. [2019-12-27 16:27:26,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16509 states. [2019-12-27 16:27:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16509 states to 16509 states and 49660 transitions. [2019-12-27 16:27:26,154 INFO L78 Accepts]: Start accepts. Automaton has 16509 states and 49660 transitions. Word has length 66 [2019-12-27 16:27:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:27:26,154 INFO L462 AbstractCegarLoop]: Abstraction has 16509 states and 49660 transitions. [2019-12-27 16:27:26,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:27:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 16509 states and 49660 transitions. [2019-12-27 16:27:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 16:27:26,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:27:26,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:27:26,171 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:27:26,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:27:26,171 INFO L82 PathProgramCache]: Analyzing trace with hash -919262302, now seen corresponding path program 1 times [2019-12-27 16:27:26,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:27:26,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498940988] [2019-12-27 16:27:26,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:27:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:27:26,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:27:26,293 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:27:26,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= 0 v_~a$w_buff1~0_266) (= 0 v_~__unbuffered_p2_EAX~0_32) (= 0 v_~weak$$choice0~0_14) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24|)) (= |v_#NULL.offset_6| 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t654~0.base_24| 4)) (= 0 v_~a$w_buff0_used~0_826) (= v_~main$tmp_guard0~0_29 0) (= 0 v_~a$r_buff0_thd2~0_102) (= |v_ULTIMATE.start_main_~#t654~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~a$r_buff0_thd0~0_110 0) (= v_~__unbuffered_cnt~0_102 0) (= v_~main$tmp_guard1~0_29 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t654~0.base_24|) (= v_~a$w_buff0~0_397 0) (= v_~a$flush_delayed~0_27 0) (= 0 |v_#NULL.base_6|) (= v_~y~0_39 0) (= v_~a$mem_tmp~0_16 0) (= v_~__unbuffered_p2_EBX~0_42 0) (= 0 v_~a$r_buff1_thd1~0_142) (= v_~a~0_178 0) (= v_~weak$$choice2~0_137 0) (= 0 v_~__unbuffered_p0_EAX~0_105) (= (store .cse0 |v_ULTIMATE.start_main_~#t654~0.base_24| 1) |v_#valid_63|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t654~0.base_24|) |v_ULTIMATE.start_main_~#t654~0.offset_19| 0))) (= v_~z~0_40 0) (= 0 v_~a$w_buff1_used~0_523) (= 0 v_~a$r_buff1_thd2~0_138) (= v_~a$r_buff1_thd3~0_297 0) (= v_~a$r_buff0_thd3~0_334 0) (= v_~a$r_buff1_thd0~0_145 0) (= v_~__unbuffered_p0_EBX~0_105 0) (= 0 v_~a$r_buff0_thd1~0_183) (= 0 v_~a$read_delayed~0_6) (= v_~a$read_delayed_var~0.offset_6 0) (= 0 v_~a$read_delayed_var~0.base_6) (= v_~x~0_88 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_19|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_138, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_75|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_47|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_110, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_137|, ~a~0=v_~a~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_27|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_32, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_105, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_297, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_826, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_183, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_6, ~a$w_buff0~0=v_~a$w_buff0~0_397, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_145, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, ~x~0=v_~x~0_88, ~a$read_delayed~0=v_~a$read_delayed~0_6, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_102, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_129|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_~#t654~0.base=|v_ULTIMATE.start_main_~#t654~0.base_24|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~a$w_buff1~0=v_~a$w_buff1~0_266, ULTIMATE.start_main_~#t654~0.offset=|v_ULTIMATE.start_main_~#t654~0.offset_19|, ~y~0=v_~y~0_39, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_26|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_29|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_142, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_334, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_40, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_523, ~weak$$choice2~0=v_~weak$$choice2~0_137, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t656~0.base, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ULTIMATE.start_main_~#t656~0.offset, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_~#t654~0.base, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ULTIMATE.start_main_~#t654~0.offset, ~y~0, ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 16:27:26,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-1-->L837: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t655~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t655~0.base_10|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t655~0.base_10|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t655~0.base_10|) |v_ULTIMATE.start_main_~#t655~0.offset_9| 1)) |v_#memory_int_13|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t655~0.base_10| 4) |v_#length_17|) (= 0 |v_ULTIMATE.start_main_~#t655~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t655~0.base=|v_ULTIMATE.start_main_~#t655~0.base_10|, ULTIMATE.start_main_~#t655~0.offset=|v_ULTIMATE.start_main_~#t655~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t655~0.base, ULTIMATE.start_main_~#t655~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 16:27:26,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L837-1-->L839: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t656~0.base_13|) (= |v_ULTIMATE.start_main_~#t656~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t656~0.base_13|) |v_ULTIMATE.start_main_~#t656~0.offset_11| 2)) |v_#memory_int_11|) (not (= 0 |v_ULTIMATE.start_main_~#t656~0.base_13|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t656~0.base_13|) 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t656~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t656~0.base=|v_ULTIMATE.start_main_~#t656~0.base_13|, ULTIMATE.start_main_~#t656~0.offset=|v_ULTIMATE.start_main_~#t656~0.offset_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t656~0.base, ULTIMATE.start_main_~#t656~0.offset, #length] because there is no mapped edge [2019-12-27 16:27:26,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork1_~arg.offset_30 |v_P0Thread1of1ForFork1_#in~arg.offset_30|) (= v_~a$w_buff0_used~0_232 v_~a$w_buff1_used~0_149) (= 1 v_~a$w_buff0_used~0_231) (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= v_~a$w_buff0~0_80 v_~a$w_buff1~0_62) (= 1 |v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|) (= 1 v_~a$w_buff0~0_79) (= |v_P0Thread1of1ForFork1_#in~arg.base_30| v_P0Thread1of1ForFork1_~arg.base_30) (= (mod v_~a$w_buff1_used~0_149 256) 0)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_80, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_232, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|} OutVars{~a$w_buff1~0=v_~a$w_buff1~0_62, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_30|, ~a$w_buff0~0=v_~a$w_buff0~0_79, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_34, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_231, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_30, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_30|, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork1___VERIFIER_assert_#in~expression_30|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_30} AuxVars[] AssignedVars[~a$w_buff1~0, ~a$w_buff0~0, P0Thread1of1ForFork1___VERIFIER_assert_~expression, ~a$w_buff0_used~0, P0Thread1of1ForFork1_~arg.offset, ~a$w_buff1_used~0, P0Thread1of1ForFork1___VERIFIER_assert_#in~expression, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:27:26,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L776-2-->L776-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1459573853 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-1459573853 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out-1459573853| ~a$w_buff1~0_In-1459573853)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out-1459573853| ~a~0_In-1459573853) (or .cse0 .cse1)))) InVars {~a~0=~a~0_In-1459573853, ~a$w_buff1~0=~a$w_buff1~0_In-1459573853, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1459573853, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1459573853} OutVars{~a~0=~a~0_In-1459573853, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1459573853|, ~a$w_buff1~0=~a$w_buff1~0_In-1459573853, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1459573853, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1459573853} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 16:27:26,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-825834920 256) 0)) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-825834920 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-825834920| 0)) (and (= ~a$w_buff0_used~0_In-825834920 |P0Thread1of1ForFork1_#t~ite5_Out-825834920|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-825834920} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-825834920|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-825834920, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-825834920} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 16:27:26,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L758-->L758-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-53277654 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-53277654 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In-53277654 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-53277654 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-53277654| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite6_Out-53277654| ~a$w_buff1_used~0_In-53277654) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53277654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53277654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53277654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53277654} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-53277654|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-53277654, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-53277654, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-53277654, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-53277654} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 16:27:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L759-->L760: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1849104733 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1849104733 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-1849104733 ~a$r_buff0_thd1~0_Out-1849104733)) (and (= 0 ~a$r_buff0_thd1~0_Out-1849104733) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849104733, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1849104733} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1849104733|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1849104733, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1849104733} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 16:27:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-2035284881 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-2035284881 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-2035284881 256))) (.cse3 (= (mod ~a$w_buff1_used~0_In-2035284881 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-2035284881| ~a$r_buff1_thd1~0_In-2035284881) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-2035284881| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2035284881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035284881, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2035284881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035284881} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-2035284881|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-2035284881, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2035284881, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-2035284881, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2035284881} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 16:27:26,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L760-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_80 |v_P0Thread1of1ForFork1_#t~ite8_52|) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_51|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_80, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:27:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-970462600 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite21_Out-970462600| ~a$w_buff0~0_In-970462600) (= |P2Thread1of1ForFork0_#t~ite20_In-970462600| |P2Thread1of1ForFork0_#t~ite20_Out-970462600|) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite20_Out-970462600| |P2Thread1of1ForFork0_#t~ite21_Out-970462600|) (= |P2Thread1of1ForFork0_#t~ite20_Out-970462600| ~a$w_buff0~0_In-970462600) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-970462600 256) 0))) (or (and (= 0 (mod ~a$w_buff1_used~0_In-970462600 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-970462600 256)) (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-970462600 256) 0)))) .cse0))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-970462600, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-970462600, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-970462600, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-970462600, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-970462600|, ~weak$$choice2~0=~weak$$choice2~0_In-970462600} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-970462600|, ~a$w_buff0~0=~a$w_buff0~0_In-970462600, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-970462600, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-970462600, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-970462600, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-970462600|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-970462600, ~weak$$choice2~0=~weak$$choice2~0_In-970462600} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 16:27:26,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L803-->L803-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1118064498 256) 0))) (or (and .cse0 (= ~a$w_buff0_used~0_In-1118064498 |P2Thread1of1ForFork0_#t~ite26_Out-1118064498|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1118064498 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1118064498 256)) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1118064498 256))) (and .cse1 (= 0 (mod ~a$w_buff1_used~0_In-1118064498 256))))) (= |P2Thread1of1ForFork0_#t~ite27_Out-1118064498| |P2Thread1of1ForFork0_#t~ite26_Out-1118064498|)) (and (= |P2Thread1of1ForFork0_#t~ite26_In-1118064498| |P2Thread1of1ForFork0_#t~ite26_Out-1118064498|) (not .cse0) (= ~a$w_buff0_used~0_In-1118064498 |P2Thread1of1ForFork0_#t~ite27_Out-1118064498|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1118064498|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1118064498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1118064498, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1118064498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1118064498, ~weak$$choice2~0=~weak$$choice2~0_In-1118064498} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1118064498|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1118064498|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1118064498, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1118064498, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1118064498, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1118064498, ~weak$$choice2~0=~weak$$choice2~0_In-1118064498} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 16:27:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L804-->L804-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1413440719 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite30_Out-1413440719| |P2Thread1of1ForFork0_#t~ite29_Out-1413440719|) (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1413440719 256) 0))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-1413440719 256)) .cse0) (= (mod ~a$w_buff0_used~0_In-1413440719 256) 0) (and (= (mod ~a$w_buff1_used~0_In-1413440719 256) 0) .cse0))) .cse1 (= ~a$w_buff1_used~0_In-1413440719 |P2Thread1of1ForFork0_#t~ite29_Out-1413440719|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite29_In-1413440719| |P2Thread1of1ForFork0_#t~ite29_Out-1413440719|) (= |P2Thread1of1ForFork0_#t~ite30_Out-1413440719| ~a$w_buff1_used~0_In-1413440719)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1413440719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413440719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1413440719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1413440719, ~weak$$choice2~0=~weak$$choice2~0_In-1413440719, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1413440719|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1413440719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1413440719, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1413440719, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1413440719|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1413440719, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1413440719|, ~weak$$choice2~0=~weak$$choice2~0_In-1413440719} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 16:27:26,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L805-->L806: Formula: (and (= v_~a$r_buff0_thd3~0_59 v_~a$r_buff0_thd3~0_60) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_59, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_7|, ~weak$$choice2~0=v_~weak$$choice2~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 16:27:26,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L776-4-->L777: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_20| v_~a~0_46) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_20|} OutVars{~a~0=v_~a~0_46, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_19|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_25|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 16:27:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In181745082 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In181745082 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out181745082|)) (and (= ~a$w_buff0_used~0_In181745082 |P1Thread1of1ForFork2_#t~ite11_Out181745082|) (or .cse0 .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In181745082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In181745082} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In181745082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In181745082, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out181745082|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:27:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In-1795510086 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1795510086 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In-1795510086 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In-1795510086 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-1795510086| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite12_Out-1795510086| ~a$w_buff1_used~0_In-1795510086)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1795510086, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1795510086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1795510086} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1795510086, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1795510086, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1795510086, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1795510086|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1795510086} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 16:27:26,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd2~0_In2025689887 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In2025689887 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out2025689887| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out2025689887| ~a$r_buff0_thd2~0_In2025689887)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2025689887, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2025689887} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2025689887, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2025689887, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out2025689887|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 16:27:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2117596950 256))) (.cse0 (= (mod ~a$r_buff0_thd2~0_In2117596950 256) 0)) (.cse2 (= (mod ~a$w_buff1_used~0_In2117596950 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd2~0_In2117596950 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out2117596950| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out2117596950| ~a$r_buff1_thd2~0_In2117596950)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2117596950, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2117596950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2117596950} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In2117596950, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In2117596950, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2117596950, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2117596950, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out2117596950|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 16:27:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite14_30| v_~a$r_buff1_thd2~0_61) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_30|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_61, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_29|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 16:27:26,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L808-->L812: Formula: (and (= v_~a$flush_delayed~0_8 0) (= v_~a~0_52 v_~a$mem_tmp~0_6) (not (= (mod v_~a$flush_delayed~0_9 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_9} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_52, ~a$mem_tmp~0=v_~a$mem_tmp~0_6, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 16:27:26,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L812-2-->L812-5: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2116894756 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In2116894756 256) 0)) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2116894756| |P2Thread1of1ForFork0_#t~ite39_Out2116894756|))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out2116894756| ~a$w_buff1~0_In2116894756) .cse0 (not .cse1) (not .cse2)) (and (or .cse1 .cse2) .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out2116894756| ~a~0_In2116894756)))) InVars {~a~0=~a~0_In2116894756, ~a$w_buff1~0=~a$w_buff1~0_In2116894756, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116894756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116894756} OutVars{~a~0=~a~0_In2116894756, P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out2116894756|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2116894756|, ~a$w_buff1~0=~a$w_buff1~0_In2116894756, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2116894756, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2116894756} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 16:27:26,321 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-1345398142 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-1345398142 256) 0))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-1345398142 |P2Thread1of1ForFork0_#t~ite40_Out-1345398142|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1345398142|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1345398142|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1345398142, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1345398142} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 16:27:26,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L814-->L814-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In-221997283 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-221997283 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-221997283 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-221997283 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-221997283|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-221997283 |P2Thread1of1ForFork0_#t~ite41_Out-221997283|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-221997283, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-221997283, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-221997283, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-221997283, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-221997283|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 16:27:26,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L815-->L815-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In1815157908 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd3~0_In1815157908 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1815157908|)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out1815157908| ~a$r_buff0_thd3~0_In1815157908) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1815157908, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1815157908} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1815157908, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1815157908, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1815157908|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 16:27:26,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1223764807 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1223764807 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In-1223764807 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1223764807 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1223764807|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd3~0_In-1223764807 |P2Thread1of1ForFork0_#t~ite43_Out-1223764807|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1223764807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1223764807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1223764807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1223764807} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1223764807|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1223764807, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1223764807, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1223764807, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1223764807} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 16:27:26,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L816-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~a$r_buff1_thd3~0_127 |v_P2Thread1of1ForFork0_#t~ite43_38|) (= v_~__unbuffered_cnt~0_59 (+ v_~__unbuffered_cnt~0_60 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_37|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 16:27:26,324 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L839-1-->L845: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:27:26,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L845-2-->L845-5: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-2115243638 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In-2115243638 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-2115243638| |ULTIMATE.start_main_#t~ite47_Out-2115243638|))) (or (and (not .cse0) .cse1 (= ~a$w_buff1~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|) (not .cse2)) (and (or .cse0 .cse2) (= ~a~0_In-2115243638 |ULTIMATE.start_main_#t~ite47_Out-2115243638|) .cse1))) InVars {~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} OutVars{~a~0=~a~0_In-2115243638, ~a$w_buff1~0=~a$w_buff1~0_In-2115243638, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-2115243638|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2115243638, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-2115243638|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2115243638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 16:27:26,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L846-->L846-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In171258570 256) 0)) (.cse0 (= (mod ~a$w_buff0_used~0_In171258570 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out171258570| ~a$w_buff0_used~0_In171258570) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out171258570| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In171258570} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In171258570, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out171258570|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In171258570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 16:27:26,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In-2100899211 256))) (.cse0 (= (mod ~a$r_buff1_thd0~0_In-2100899211 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-2100899211 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-2100899211 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-2100899211| ~a$w_buff1_used~0_In-2100899211) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite50_Out-2100899211| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2100899211, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100899211, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2100899211, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100899211} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-2100899211|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2100899211, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2100899211, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2100899211, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2100899211} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 16:27:26,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-1683622436 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1683622436 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out-1683622436|)) (and (= ~a$r_buff0_thd0~0_In-1683622436 |ULTIMATE.start_main_#t~ite51_Out-1683622436|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683622436} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1683622436|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1683622436, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1683622436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 16:27:26,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L849-->L849-2: Formula: (let ((.cse3 (= (mod ~a$w_buff0_used~0_In187955541 256) 0)) (.cse2 (= (mod ~a$r_buff0_thd0~0_In187955541 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In187955541 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In187955541 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out187955541| ~a$r_buff1_thd0~0_In187955541)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite52_Out187955541| 0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out187955541|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In187955541, ~a$w_buff0_used~0=~a$w_buff0_used~0_In187955541, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In187955541, ~a$w_buff1_used~0=~a$w_buff1_used~0_In187955541} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 16:27:26,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~main$tmp_guard1~0_17 0) (= 1 v_~__unbuffered_p0_EAX~0_40) (= 2 v_~__unbuffered_p2_EAX~0_20) (= |v_ULTIMATE.start_main_#t~ite52_35| v_~a$r_buff1_thd0~0_75) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_~__unbuffered_p0_EBX~0_40 0) (= v_~z~0_25 2)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_35|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_34|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_40, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_75, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_20, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:27:26,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:27:26 BasicIcfg [2019-12-27 16:27:26,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:27:26,435 INFO L168 Benchmark]: Toolchain (without parser) took 185976.21 ms. Allocated memory was 144.7 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 100.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,436 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.57 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 155.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,437 INFO L168 Benchmark]: Boogie Preprocessor took 39.82 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,437 INFO L168 Benchmark]: RCFGBuilder took 822.66 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 99.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,438 INFO L168 Benchmark]: TraceAbstraction took 184226.06 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 16:27:26,440 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.57 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 100.4 MB in the beginning and 155.2 MB in the end (delta: -54.8 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.56 ms. Allocated memory is still 202.4 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.82 ms. Allocated memory is still 202.4 MB. Free memory was 152.5 MB in the beginning and 150.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 822.66 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 99.6 MB in the end (delta: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 184226.06 ms. Allocated memory was 202.4 MB in the beginning and 4.0 GB in the end (delta: 3.8 GB). Free memory was 99.6 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 178 ProgramPointsBefore, 93 ProgramPointsAfterwards, 215 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 32 ChoiceCompositions, 7050 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 63 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78858 CheckedPairsTotal, 113 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(&t654, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t655, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L839] FCALL, FORK 0 pthread_create(&t656, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L740] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L741] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L742] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L743] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L744] 1 a$r_buff0_thd1 = (_Bool)1 [L747] 1 x = 1 [L750] 1 __unbuffered_p0_EAX = x [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 y = 1 [L773] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L776] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L756] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L757] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L790] 3 z = 2 [L793] 3 __unbuffered_p2_EAX = z [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L758] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=2] [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=2] [L777] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L778] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L779] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=1, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2] [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 183.8s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 84.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9637 SDtfs, 16965 SDslu, 50792 SDs, 0 SdLazy, 46449 SolverSat, 1239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 49.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1255 GetRequests, 432 SyntacticMatches, 171 SemanticMatches, 652 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5580 ImplicationChecksByTransitivity, 16.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151748occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 51.9s AutomataMinimizationTime, 37 MinimizatonAttempts, 557712 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1915 ConstructedInterpolants, 0 QuantifiedInterpolants, 416707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...