/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/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration false -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-89f541c [2020-08-27 21:49:07,214 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-27 21:49:07,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-27 21:49:07,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-27 21:49:07,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-27 21:49:07,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-27 21:49:07,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-27 21:49:07,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-27 21:49:07,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-27 21:49:07,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-27 21:49:07,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-27 21:49:07,259 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-27 21:49:07,259 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-27 21:49:07,260 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-27 21:49:07,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-27 21:49:07,263 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-27 21:49:07,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-27 21:49:07,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-27 21:49:07,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-27 21:49:07,269 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-27 21:49:07,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-27 21:49:07,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-27 21:49:07,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-27 21:49:07,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-27 21:49:07,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-27 21:49:07,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-27 21:49:07,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-27 21:49:07,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-27 21:49:07,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-27 21:49:07,289 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-27 21:49:07,289 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-27 21:49:07,290 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-27 21:49:07,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-27 21:49:07,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-27 21:49:07,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-27 21:49:07,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-27 21:49:07,299 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-27 21:49:07,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-27 21:49:07,300 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-27 21:49:07,301 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-27 21:49:07,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-27 21:49:07,303 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-27 21:49:07,365 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-27 21:49:07,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-27 21:49:07,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-27 21:49:07,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-27 21:49:07,369 INFO L138 SettingsManager]: * Use SBE=true [2020-08-27 21:49:07,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-27 21:49:07,370 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-27 21:49:07,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-27 21:49:07,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-27 21:49:07,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-27 21:49:07,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-27 21:49:07,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-27 21:49:07,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-27 21:49:07,374 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-27 21:49:07,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-27 21:49:07,374 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-27 21:49:07,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-27 21:49:07,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-27 21:49:07,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-27 21:49:07,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-27 21:49:07,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-27 21:49:07,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-27 21:49:07,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-27 21:49:07,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-27 21:49:07,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-27 21:49:07,376 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-27 21:49:07,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-27 21:49:07,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-27 21:49:07,377 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-27 21:49:07,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> false [2020-08-27 21:49:07,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-27 21:49:07,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-27 21:49:07,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-27 21:49:07,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-27 21:49:07,931 INFO L275 PluginConnector]: CDTParser initialized [2020-08-27 21:49:07,933 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-27 21:49:08,037 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9281e64c2/6e3a6d4d0f154d7da7a1475dc7e7d6fd/FLAGb2e2f29cf [2020-08-27 21:49:08,595 INFO L306 CDTParser]: Found 1 translation units. [2020-08-27 21:49:08,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_2calls_4-1.c [2020-08-27 21:49:08,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9281e64c2/6e3a6d4d0f154d7da7a1475dc7e7d6fd/FLAGb2e2f29cf [2020-08-27 21:49:08,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/9281e64c2/6e3a6d4d0f154d7da7a1475dc7e7d6fd [2020-08-27 21:49:08,958 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-27 21:49:08,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-27 21:49:08,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:08,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-27 21:49:08,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-27 21:49:08,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:08" (1/1) ... [2020-08-27 21:49:08,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cc40f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:08, skipping insertion in model container [2020-08-27 21:49:08,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:49:08" (1/1) ... [2020-08-27 21:49:08,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-27 21:49:09,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-27 21:49:09,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:09,241 INFO L203 MainTranslator]: Completed pre-run [2020-08-27 21:49:09,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-27 21:49:09,282 INFO L208 MainTranslator]: Completed translation [2020-08-27 21:49:09,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09 WrapperNode [2020-08-27 21:49:09,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-27 21:49:09,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-27 21:49:09,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-27 21:49:09,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-27 21:49:09,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... [2020-08-27 21:49:09,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-27 21:49:09,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-27 21:49:09,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-27 21:49:09,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-27 21:49:09,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-08-27 21:49:09,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-27 21:49:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-27 21:49:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2020-08-27 21:49:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2020-08-27 21:49:09,496 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-27 21:49:09,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-27 21:49:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-27 21:49:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2020-08-27 21:49:09,497 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2020-08-27 21:49:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-27 21:49:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-27 21:49:09,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-27 21:49:09,744 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-27 21:49:09,744 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-27 21:49:09,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:09 BoogieIcfgContainer [2020-08-27 21:49:09,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-27 21:49:09,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-27 21:49:09,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-27 21:49:09,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-27 21:49:09,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:49:08" (1/3) ... [2020-08-27 21:49:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75437766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:09, skipping insertion in model container [2020-08-27 21:49:09,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:49:09" (2/3) ... [2020-08-27 21:49:09,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75437766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:49:09, skipping insertion in model container [2020-08-27 21:49:09,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:49:09" (3/3) ... [2020-08-27 21:49:09,761 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_4-1.c [2020-08-27 21:49:09,771 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-27 21:49:09,781 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-27 21:49:09,801 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-27 21:49:09,834 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-27 21:49:09,834 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-27 21:49:09,835 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-27 21:49:09,835 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-27 21:49:09,835 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-27 21:49:09,835 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-27 21:49:09,835 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-27 21:49:09,836 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-27 21:49:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-08-27 21:49:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-27 21:49:09,865 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:09,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:09,867 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2020-08-27 21:49:09,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:09,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2145520547] [2020-08-27 21:49:09,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:10,139 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2145520547] [2020-08-27 21:49:10,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:10,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:10,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393046264] [2020-08-27 21:49:10,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:10,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:10,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:10,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:10,178 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-08-27 21:49:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:10,348 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2020-08-27 21:49:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:10,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-27 21:49:10,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:10,365 INFO L225 Difference]: With dead ends: 44 [2020-08-27 21:49:10,365 INFO L226 Difference]: Without dead ends: 30 [2020-08-27 21:49:10,370 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:10,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-08-27 21:49:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-08-27 21:49:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-27 21:49:10,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2020-08-27 21:49:10,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:10,429 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-27 21:49:10,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:10,429 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-27 21:49:10,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-27 21:49:10,432 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:10,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:10,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-27 21:49:10,433 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:10,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2020-08-27 21:49:10,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:10,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1959243662] [2020-08-27 21:49:10,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-27 21:49:10,511 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1959243662] [2020-08-27 21:49:10,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-27 21:49:10,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-27 21:49:10,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346315111] [2020-08-27 21:49:10,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-27 21:49:10,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-27 21:49:10,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-27 21:49:10,516 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2020-08-27 21:49:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:10,589 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-08-27 21:49:10,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-27 21:49:10,590 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-27 21:49:10,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:10,592 INFO L225 Difference]: With dead ends: 36 [2020-08-27 21:49:10,593 INFO L226 Difference]: Without dead ends: 32 [2020-08-27 21:49:10,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:10,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-08-27 21:49:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-08-27 21:49:10,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-08-27 21:49:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-08-27 21:49:10,605 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2020-08-27 21:49:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:10,606 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-08-27 21:49:10,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-27 21:49:10,606 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-08-27 21:49:10,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-27 21:49:10,608 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:10,608 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:10,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-27 21:49:10,609 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:10,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2020-08-27 21:49:10,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:10,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615060090] [2020-08-27 21:49:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-27 21:49:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:49:10,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615060090] [2020-08-27 21:49:10,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:10,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:10,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513394491] [2020-08-27 21:49:10,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:10,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:10,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:10,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:10,786 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2020-08-27 21:49:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:10,885 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2020-08-27 21:49:10,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-27 21:49:10,886 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-08-27 21:49:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:10,887 INFO L225 Difference]: With dead ends: 58 [2020-08-27 21:49:10,888 INFO L226 Difference]: Without dead ends: 34 [2020-08-27 21:49:10,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:10,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-08-27 21:49:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-08-27 21:49:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-08-27 21:49:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-08-27 21:49:10,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2020-08-27 21:49:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:10,902 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-08-27 21:49:10,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:10,902 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-08-27 21:49:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-27 21:49:10,904 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:10,904 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:10,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-27 21:49:10,905 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:10,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2020-08-27 21:49:10,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:10,906 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [759039362] [2020-08-27 21:49:10,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:10,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-08-27 21:49:11,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [759039362] [2020-08-27 21:49:11,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:11,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:11,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24964982] [2020-08-27 21:49:11,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:11,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:11,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:11,037 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2020-08-27 21:49:11,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:11,260 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2020-08-27 21:49:11,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:11,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-08-27 21:49:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:11,264 INFO L225 Difference]: With dead ends: 54 [2020-08-27 21:49:11,265 INFO L226 Difference]: Without dead ends: 50 [2020-08-27 21:49:11,265 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-27 21:49:11,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-27 21:49:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-08-27 21:49:11,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-08-27 21:49:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2020-08-27 21:49:11,280 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 27 [2020-08-27 21:49:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:11,281 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2020-08-27 21:49:11,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:11,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2020-08-27 21:49:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-08-27 21:49:11,283 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:11,283 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:11,284 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-27 21:49:11,284 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:11,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:11,284 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2020-08-27 21:49:11,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:11,285 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281229963] [2020-08-27 21:49:11,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-27 21:49:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-27 21:49:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-27 21:49:11,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281229963] [2020-08-27 21:49:11,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:11,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-27 21:49:11,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209715719] [2020-08-27 21:49:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-27 21:49:11,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:11,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-27 21:49:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-27 21:49:11,428 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand 6 states. [2020-08-27 21:49:11,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:11,511 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2020-08-27 21:49:11,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-27 21:49:11,512 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-08-27 21:49:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:11,514 INFO L225 Difference]: With dead ends: 94 [2020-08-27 21:49:11,515 INFO L226 Difference]: Without dead ends: 52 [2020-08-27 21:49:11,516 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-08-27 21:49:11,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-08-27 21:49:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-08-27 21:49:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2020-08-27 21:49:11,530 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 39 [2020-08-27 21:49:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:11,530 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-08-27 21:49:11,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-27 21:49:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2020-08-27 21:49:11,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-27 21:49:11,533 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:11,533 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:11,533 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-27 21:49:11,534 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2020-08-27 21:49:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:11,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2025516292] [2020-08-27 21:49:11,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-08-27 21:49:11,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2025516292] [2020-08-27 21:49:11,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:11,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:11,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010136852] [2020-08-27 21:49:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:11,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:11,739 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 8 states. [2020-08-27 21:49:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:11,861 INFO L93 Difference]: Finished difference Result 103 states and 158 transitions. [2020-08-27 21:49:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-27 21:49:11,862 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2020-08-27 21:49:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:11,864 INFO L225 Difference]: With dead ends: 103 [2020-08-27 21:49:11,864 INFO L226 Difference]: Without dead ends: 57 [2020-08-27 21:49:11,866 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-08-27 21:49:11,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2020-08-27 21:49:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-08-27 21:49:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2020-08-27 21:49:11,878 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 40 [2020-08-27 21:49:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:11,879 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2020-08-27 21:49:11,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2020-08-27 21:49:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-08-27 21:49:11,882 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:11,882 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:11,882 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-27 21:49:11,882 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:11,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:11,883 INFO L82 PathProgramCache]: Analyzing trace with hash 208191613, now seen corresponding path program 1 times [2020-08-27 21:49:11,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:11,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [455822187] [2020-08-27 21:49:11,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:11,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-08-27 21:49:12,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [455822187] [2020-08-27 21:49:12,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:12,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:12,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953405632] [2020-08-27 21:49:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:12,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:12,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:12,021 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand 8 states. [2020-08-27 21:49:12,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:12,240 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2020-08-27 21:49:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:12,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-08-27 21:49:12,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:12,244 INFO L225 Difference]: With dead ends: 86 [2020-08-27 21:49:12,244 INFO L226 Difference]: Without dead ends: 82 [2020-08-27 21:49:12,245 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-08-27 21:49:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-08-27 21:49:12,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2020-08-27 21:49:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-08-27 21:49:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 118 transitions. [2020-08-27 21:49:12,264 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 118 transitions. Word has length 41 [2020-08-27 21:49:12,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:12,265 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 118 transitions. [2020-08-27 21:49:12,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:12,265 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 118 transitions. [2020-08-27 21:49:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-27 21:49:12,269 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:12,269 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:12,269 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-27 21:49:12,270 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2020-08-27 21:49:12,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:12,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [431444406] [2020-08-27 21:49:12,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-27 21:49:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2020-08-27 21:49:12,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [431444406] [2020-08-27 21:49:12,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:12,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-27 21:49:12,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245767859] [2020-08-27 21:49:12,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-27 21:49:12,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-27 21:49:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-27 21:49:12,453 INFO L87 Difference]: Start difference. First operand 79 states and 118 transitions. Second operand 8 states. [2020-08-27 21:49:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:12,580 INFO L93 Difference]: Finished difference Result 167 states and 288 transitions. [2020-08-27 21:49:12,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:12,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-08-27 21:49:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:12,583 INFO L225 Difference]: With dead ends: 167 [2020-08-27 21:49:12,583 INFO L226 Difference]: Without dead ends: 94 [2020-08-27 21:49:12,585 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2020-08-27 21:49:12,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2020-08-27 21:49:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-08-27 21:49:12,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 134 transitions. [2020-08-27 21:49:12,602 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 134 transitions. Word has length 54 [2020-08-27 21:49:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:12,603 INFO L479 AbstractCegarLoop]: Abstraction has 88 states and 134 transitions. [2020-08-27 21:49:12,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-27 21:49:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 134 transitions. [2020-08-27 21:49:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-27 21:49:12,606 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:12,606 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:12,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-27 21:49:12,607 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:12,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:12,607 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2020-08-27 21:49:12,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:12,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523584531] [2020-08-27 21:49:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-08-27 21:49:12,777 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523584531] [2020-08-27 21:49:12,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:12,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:12,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126131868] [2020-08-27 21:49:12,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:12,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:12,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:12,780 INFO L87 Difference]: Start difference. First operand 88 states and 134 transitions. Second operand 10 states. [2020-08-27 21:49:13,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:13,042 INFO L93 Difference]: Finished difference Result 188 states and 331 transitions. [2020-08-27 21:49:13,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:13,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2020-08-27 21:49:13,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:13,045 INFO L225 Difference]: With dead ends: 188 [2020-08-27 21:49:13,045 INFO L226 Difference]: Without dead ends: 109 [2020-08-27 21:49:13,047 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:13,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-08-27 21:49:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2020-08-27 21:49:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-08-27 21:49:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 158 transitions. [2020-08-27 21:49:13,064 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 158 transitions. Word has length 55 [2020-08-27 21:49:13,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:13,064 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 158 transitions. [2020-08-27 21:49:13,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 158 transitions. [2020-08-27 21:49:13,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-08-27 21:49:13,067 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:13,067 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:13,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-27 21:49:13,067 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash -908952008, now seen corresponding path program 2 times [2020-08-27 21:49:13,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:13,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1894164172] [2020-08-27 21:49:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,367 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 30 proven. 52 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2020-08-27 21:49:13,367 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1894164172] [2020-08-27 21:49:13,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:13,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-08-27 21:49:13,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074039986] [2020-08-27 21:49:13,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-27 21:49:13,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:13,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-27 21:49:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-08-27 21:49:13,370 INFO L87 Difference]: Start difference. First operand 100 states and 158 transitions. Second operand 12 states. [2020-08-27 21:49:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:13,788 INFO L93 Difference]: Finished difference Result 199 states and 354 transitions. [2020-08-27 21:49:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-27 21:49:13,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2020-08-27 21:49:13,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:13,791 INFO L225 Difference]: With dead ends: 199 [2020-08-27 21:49:13,791 INFO L226 Difference]: Without dead ends: 86 [2020-08-27 21:49:13,793 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:49:13,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-08-27 21:49:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2020-08-27 21:49:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-08-27 21:49:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2020-08-27 21:49:13,804 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 82 [2020-08-27 21:49:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:13,804 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2020-08-27 21:49:13,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-27 21:49:13,805 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2020-08-27 21:49:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-08-27 21:49:13,806 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:13,806 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:13,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-27 21:49:13,807 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1156896337, now seen corresponding path program 1 times [2020-08-27 21:49:13,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:13,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005167123] [2020-08-27 21:49:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:13,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-08-27 21:49:14,216 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005167123] [2020-08-27 21:49:14,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:14,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-08-27 21:49:14,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491461648] [2020-08-27 21:49:14,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-08-27 21:49:14,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:14,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-08-27 21:49:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2020-08-27 21:49:14,219 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand 17 states. [2020-08-27 21:49:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:14,441 INFO L93 Difference]: Finished difference Result 96 states and 126 transitions. [2020-08-27 21:49:14,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-08-27 21:49:14,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2020-08-27 21:49:14,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:14,443 INFO L225 Difference]: With dead ends: 96 [2020-08-27 21:49:14,443 INFO L226 Difference]: Without dead ends: 92 [2020-08-27 21:49:14,444 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2020-08-27 21:49:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-08-27 21:49:14,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2020-08-27 21:49:14,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-27 21:49:14,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2020-08-27 21:49:14,455 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 68 [2020-08-27 21:49:14,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:14,456 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2020-08-27 21:49:14,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-08-27 21:49:14,456 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2020-08-27 21:49:14,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-08-27 21:49:14,458 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:14,458 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:14,458 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-27 21:49:14,458 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1711191765, now seen corresponding path program 2 times [2020-08-27 21:49:14,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:14,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [143142560] [2020-08-27 21:49:14,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-27 21:49:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2020-08-27 21:49:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,584 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-08-27 21:49:14,584 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [143142560] [2020-08-27 21:49:14,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:14,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-27 21:49:14,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372219079] [2020-08-27 21:49:14,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-27 21:49:14,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-27 21:49:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-27 21:49:14,586 INFO L87 Difference]: Start difference. First operand 81 states and 107 transitions. Second operand 7 states. [2020-08-27 21:49:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:14,681 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2020-08-27 21:49:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-27 21:49:14,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2020-08-27 21:49:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:14,683 INFO L225 Difference]: With dead ends: 143 [2020-08-27 21:49:14,683 INFO L226 Difference]: Without dead ends: 70 [2020-08-27 21:49:14,684 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-27 21:49:14,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-27 21:49:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-27 21:49:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2020-08-27 21:49:14,691 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 69 [2020-08-27 21:49:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:14,692 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2020-08-27 21:49:14,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-27 21:49:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2020-08-27 21:49:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-08-27 21:49:14,693 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:14,694 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:14,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-27 21:49:14,694 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 3 times [2020-08-27 21:49:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:14,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765643299] [2020-08-27 21:49:14,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-27 21:49:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 44 proven. 79 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2020-08-27 21:49:14,980 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765643299] [2020-08-27 21:49:14,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:14,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:14,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855130309] [2020-08-27 21:49:14,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:14,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:14,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:14,983 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand 10 states. [2020-08-27 21:49:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:15,168 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2020-08-27 21:49:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-27 21:49:15,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2020-08-27 21:49:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:15,170 INFO L225 Difference]: With dead ends: 131 [2020-08-27 21:49:15,170 INFO L226 Difference]: Without dead ends: 70 [2020-08-27 21:49:15,172 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-08-27 21:49:15,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-08-27 21:49:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-27 21:49:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2020-08-27 21:49:15,179 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 110 [2020-08-27 21:49:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:15,180 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-08-27 21:49:15,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2020-08-27 21:49:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2020-08-27 21:49:15,182 INFO L414 BasicCegarLoop]: Found error trace [2020-08-27 21:49:15,182 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-27 21:49:15,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-27 21:49:15,182 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-27 21:49:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-27 21:49:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2011292190, now seen corresponding path program 2 times [2020-08-27 21:49:15,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-27 21:49:15,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196827945] [2020-08-27 21:49:15,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-27 21:49:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-27 21:49:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-27 21:49:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-27 21:49:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-27 21:49:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-27 21:49:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-27 21:49:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-27 21:49:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-27 21:49:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 40 proven. 124 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2020-08-27 21:49:15,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196827945] [2020-08-27 21:49:15,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-27 21:49:15,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-27 21:49:15,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079215717] [2020-08-27 21:49:15,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-27 21:49:15,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-27 21:49:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-27 21:49:15,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-27 21:49:15,504 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand 10 states. [2020-08-27 21:49:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-27 21:49:15,705 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2020-08-27 21:49:15,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-27 21:49:15,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 136 [2020-08-27 21:49:15,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-27 21:49:15,706 INFO L225 Difference]: With dead ends: 77 [2020-08-27 21:49:15,707 INFO L226 Difference]: Without dead ends: 0 [2020-08-27 21:49:15,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-08-27 21:49:15,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-27 21:49:15,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-27 21:49:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-27 21:49:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-27 21:49:15,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136 [2020-08-27 21:49:15,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-27 21:49:15,709 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-27 21:49:15,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-27 21:49:15,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-27 21:49:15,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-27 21:49:15,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-27 21:49:15,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-27 21:49:16,339 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 15 [2020-08-27 21:49:16,557 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 25 [2020-08-27 21:49:16,562 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-27 21:49:16,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:49:16,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-27 21:49:16,562 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-27 21:49:16,562 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-27 21:49:16,562 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-27 21:49:16,562 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2020-08-27 21:49:16,562 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 35 42) the Hoare annotation is: true [2020-08-27 21:49:16,562 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 35 42) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 35 42) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4 main_~x~0) (<= main_~x~0 4)) [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2020-08-27 21:49:16,563 INFO L271 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2020-08-27 21:49:16,563 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 1))) [2020-08-27 21:49:16,563 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L264 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#t~ret2| 1) .cse0 (<= 1 |fibo2_#t~ret2|) (<= 2 |fibo2_#in~n|) (<= |fibo2_#in~n| 2)) (and (<= 4 fibo2_~n) .cse0))) [2020-08-27 21:49:16,564 INFO L268 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L268 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L268 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L268 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L268 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2020-08-27 21:49:16,564 INFO L271 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2020-08-27 21:49:16,564 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 2)) (= fibo1_~n |fibo1_#in~n|)) [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-08-27 21:49:16,565 INFO L264 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= |fibo1_#in~n| 3) .cse0) (and (<= 2 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 2) .cse0) (and (<= 5 |fibo1_#in~n|) .cse0))) (not (<= |fibo1_#in~n| 2)) (or (and (<= |fibo1_#t~ret0| 1) (<= 1 |fibo1_#t~ret0|)) (<= 4 fibo1_~n))) [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2020-08-27 21:49:16,565 INFO L268 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2020-08-27 21:49:16,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:49:16 BoogieIcfgContainer [2020-08-27 21:49:16,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-27 21:49:16,577 INFO L168 Benchmark]: Toolchain (without parser) took 7617.28 ms. Allocated memory was 146.3 MB in the beginning and 322.4 MB in the end (delta: 176.2 MB). Free memory was 102.6 MB in the beginning and 177.7 MB in the end (delta: -75.1 MB). Peak memory consumption was 101.0 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,578 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.33 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,584 INFO L168 Benchmark]: Boogie Preprocessor took 130.43 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 92.7 MB in the beginning and 181.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,589 INFO L168 Benchmark]: RCFGBuilder took 335.75 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 167.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,591 INFO L168 Benchmark]: TraceAbstraction took 6823.31 ms. Allocated memory was 202.4 MB in the beginning and 322.4 MB in the end (delta: 120.1 MB). Free memory was 167.0 MB in the beginning and 177.7 MB in the end (delta: -10.7 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. [2020-08-27 21:49:16,595 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 321.33 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 130.43 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 92.7 MB in the beginning and 181.5 MB in the end (delta: -88.8 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 335.75 ms. Allocated memory is still 202.4 MB. Free memory was 181.5 MB in the beginning and 167.7 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6823.31 ms. Allocated memory was 202.4 MB in the beginning and 322.4 MB in the end (delta: 120.1 MB). Free memory was 167.0 MB in the beginning and 177.7 MB in the end (delta: -10.7 MB). Peak memory consumption was 109.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.8s, OverallIterations: 14, TraceHistogramMax: 10, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 436 SDtfs, 293 SDslu, 2109 SDs, 0 SdLazy, 1551 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 48 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 344 PreInvPairs, 398 NumberOfFragments, 94 HoareAnnotationTreeSize, 344 FomulaSimplifications, 448 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 11 FomulaSimplificationsInter, 770 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 774 NumberOfCodeBlocks, 774 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 103564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 816/1159 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...