/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_o20.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.0-7d8eed3
[2020-11-07 05:08:01,679 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-11-07 05:08:01,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-11-07 05:08:01,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-11-07 05:08:01,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-11-07 05:08:01,753 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-11-07 05:08:01,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-11-07 05:08:01,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-11-07 05:08:01,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-11-07 05:08:01,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-11-07 05:08:01,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-11-07 05:08:01,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-11-07 05:08:01,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-11-07 05:08:01,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-11-07 05:08:01,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-11-07 05:08:01,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-11-07 05:08:01,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-11-07 05:08:01,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-11-07 05:08:01,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-11-07 05:08:01,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-11-07 05:08:01,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-11-07 05:08:01,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-11-07 05:08:01,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-11-07 05:08:01,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-11-07 05:08:01,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-11-07 05:08:01,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-11-07 05:08:01,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-11-07 05:08:01,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-11-07 05:08:01,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-11-07 05:08:01,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-11-07 05:08:01,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-11-07 05:08:01,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-11-07 05:08:01,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-11-07 05:08:01,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-11-07 05:08:01,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-11-07 05:08:01,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-11-07 05:08:01,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-11-07 05:08:01,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-11-07 05:08:01,830 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-11-07 05:08:01,831 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-11-07 05:08:01,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-11-07 05:08:01,833 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-11-07 05:08:01,847 INFO L113 SettingsManager]: Loading preferences was successful
[2020-11-07 05:08:01,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-11-07 05:08:01,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-11-07 05:08:01,849 INFO L138 SettingsManager]: * sizeof long=4
[2020-11-07 05:08:01,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-11-07 05:08:01,850 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-11-07 05:08:01,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-11-07 05:08:01,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-11-07 05:08:01,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-11-07 05:08:01,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-11-07 05:08:01,851 INFO L138 SettingsManager]: * sizeof long double=12
[2020-11-07 05:08:01,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-11-07 05:08:01,852 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-11-07 05:08:01,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-11-07 05:08:01,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-11-07 05:08:01,853 INFO L138 SettingsManager]: * Size of a code block=SingleStatement
[2020-11-07 05:08:01,853 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-11-07 05:08:01,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-11-07 05:08:01,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-07 05:08:01,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-11-07 05:08:01,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-11-07 05:08:01,854 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-11-07 05:08:01,855 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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: Use separate solver for trace checks -> true
[2020-11-07 05:08:02,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2020-11-07 05:08:02,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-11-07 05:08:02,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-11-07 05:08:02,285 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-11-07 05:08:02,286 INFO L275 PluginConnector]: CDTParser initialized
[2020-11-07 05:08:02,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_o20.c
[2020-11-07 05:08:02,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9447193e/dcca24e207c643b0b041a2177e9a5852/FLAG4c4eff87c
[2020-11-07 05:08:02,943 INFO L306 CDTParser]: Found 1 translation units.
[2020-11-07 05:08:02,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_o20.c
[2020-11-07 05:08:02,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9447193e/dcca24e207c643b0b041a2177e9a5852/FLAG4c4eff87c
[2020-11-07 05:08:03,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9447193e/dcca24e207c643b0b041a2177e9a5852
[2020-11-07 05:08:03,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-11-07 05:08:03,303 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-11-07 05:08:03,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-11-07 05:08:03,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-11-07 05:08:03,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-11-07 05:08:03,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc6dd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03, skipping insertion in model container
[2020-11-07 05:08:03,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-11-07 05:08:03,336 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-11-07 05:08:03,490 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-07 05:08:03,501 INFO L203 MainTranslator]: Completed pre-run
[2020-11-07 05:08:03,517 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-11-07 05:08:03,533 INFO L208 MainTranslator]: Completed translation
[2020-11-07 05:08:03,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03 WrapperNode
[2020-11-07 05:08:03,534 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-11-07 05:08:03,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-11-07 05:08:03,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-11-07 05:08:03,536 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-11-07 05:08:03,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
[2020-11-07 05:08:03,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-11-07 05:08:03,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-11-07 05:08:03,569 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-11-07 05:08:03,570 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-11-07 05:08:03,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-11-07 05:08:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-11-07 05:08:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-11-07 05:08:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2020-11-07 05:08:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure id
[2020-11-07 05:08:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-11-07 05:08:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2020-11-07 05:08:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-11-07 05:08:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2020-11-07 05:08:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2020-11-07 05:08:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure id
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-11-07 05:08:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2020-11-07 05:08:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2020-11-07 05:08:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-11-07 05:08:03,897 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-11-07 05:08:03,898 INFO L298 CfgBuilder]: Removed 0 assume(true) statements.
[2020-11-07 05:08:03,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:03 BoogieIcfgContainer
[2020-11-07 05:08:03,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-11-07 05:08:03,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-11-07 05:08:03,903 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-11-07 05:08:03,906 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-11-07 05:08:03,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:08:03" (1/3) ...
[2020-11-07 05:08:03,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1ad57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:03, skipping insertion in model container
[2020-11-07 05:08:03,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:08:03" (2/3) ...
[2020-11-07 05:08:03,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1ad57e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:08:03, skipping insertion in model container
[2020-11-07 05:08:03,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:08:03" (3/3) ...
[2020-11-07 05:08:03,910 INFO L111 eAbstractionObserver]: Analyzing ICFG id_o20.c
[2020-11-07 05:08:03,930 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-11-07 05:08:03,934 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-11-07 05:08:03,970 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-11-07 05:08:04,043 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2020-11-07 05:08:04,044 INFO L378 AbstractCegarLoop]: Hoare is true
[2020-11-07 05:08:04,044 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation
[2020-11-07 05:08:04,044 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-11-07 05:08:04,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-11-07 05:08:04,047 INFO L382 AbstractCegarLoop]: Difference is false
[2020-11-07 05:08:04,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-11-07 05:08:04,048 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-11-07 05:08:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states.
[2020-11-07 05:08:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2020-11-07 05:08:04,109 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:04,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:04,111 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:04,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:04,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2039876327, now seen corresponding path program 1 times
[2020-11-07 05:08:04,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:04,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1048584183]
[2020-11-07 05:08:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:04,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:04,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-11-07 05:08:04,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1048584183]
[2020-11-07 05:08:04,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-11-07 05:08:04,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-11-07 05:08:04,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262849930]
[2020-11-07 05:08:04,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-11-07 05:08:04,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-11-07 05:08:04,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2020-11-07 05:08:04,621 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 6 states.
[2020-11-07 05:08:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:05,015 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions.
[2020-11-07 05:08:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-11-07 05:08:05,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2020-11-07 05:08:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:05,029 INFO L225 Difference]: With dead ends: 50
[2020-11-07 05:08:05,029 INFO L226 Difference]: Without dead ends: 31
[2020-11-07 05:08:05,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2020-11-07 05:08:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2020-11-07 05:08:05,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31.
[2020-11-07 05:08:05,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2020-11-07 05:08:05,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions.
[2020-11-07 05:08:05,098 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25
[2020-11-07 05:08:05,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:05,099 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions.
[2020-11-07 05:08:05,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-11-07 05:08:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions.
[2020-11-07 05:08:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2020-11-07 05:08:05,103 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:05,103 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, 1, 1, 1, 1, 1]
[2020-11-07 05:08:05,103 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-11-07 05:08:05,104 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:05,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1789799325, now seen corresponding path program 1 times
[2020-11-07 05:08:05,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:05,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220629960]
[2020-11-07 05:08:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:05,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:05,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:05,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2020-11-07 05:08:05,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220629960]
[2020-11-07 05:08:05,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:05,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8
[2020-11-07 05:08:05,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38215213]
[2020-11-07 05:08:05,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-11-07 05:08:05,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-11-07 05:08:05,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2020-11-07 05:08:05,460 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states.
[2020-11-07 05:08:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:05,856 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions.
[2020-11-07 05:08:05,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2020-11-07 05:08:05,857 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32
[2020-11-07 05:08:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:05,859 INFO L225 Difference]: With dead ends: 41
[2020-11-07 05:08:05,859 INFO L226 Difference]: Without dead ends: 35
[2020-11-07 05:08:05,861 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210
[2020-11-07 05:08:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2020-11-07 05:08:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35.
[2020-11-07 05:08:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2020-11-07 05:08:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions.
[2020-11-07 05:08:05,890 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32
[2020-11-07 05:08:05,890 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:05,890 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions.
[2020-11-07 05:08:05,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-11-07 05:08:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions.
[2020-11-07 05:08:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2020-11-07 05:08:05,892 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:05,892 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 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]
[2020-11-07 05:08:05,893 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-11-07 05:08:05,893 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash 819538851, now seen corresponding path program 2 times
[2020-11-07 05:08:05,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:05,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267318306]
[2020-11-07 05:08:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2020-11-07 05:08:06,164 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267318306]
[2020-11-07 05:08:06,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:06,164 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10
[2020-11-07 05:08:06,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241395972]
[2020-11-07 05:08:06,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states
[2020-11-07 05:08:06,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:06,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2020-11-07 05:08:06,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2020-11-07 05:08:06,167 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 10 states.
[2020-11-07 05:08:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:06,700 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions.
[2020-11-07 05:08:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2020-11-07 05:08:06,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39
[2020-11-07 05:08:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:06,702 INFO L225 Difference]: With dead ends: 45
[2020-11-07 05:08:06,702 INFO L226 Difference]: Without dead ends: 39
[2020-11-07 05:08:06,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380
[2020-11-07 05:08:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2020-11-07 05:08:06,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39.
[2020-11-07 05:08:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states.
[2020-11-07 05:08:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions.
[2020-11-07 05:08:06,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 39
[2020-11-07 05:08:06,717 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:06,717 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions.
[2020-11-07 05:08:06,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states.
[2020-11-07 05:08:06,717 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions.
[2020-11-07 05:08:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2020-11-07 05:08:06,719 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:06,719 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:06,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-11-07 05:08:06,719 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1214666029, now seen corresponding path program 3 times
[2020-11-07 05:08:06,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:06,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076843069]
[2020-11-07 05:08:06,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:06,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:07,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:07,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:07,073 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2020-11-07 05:08:07,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076843069]
[2020-11-07 05:08:07,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:07,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12
[2020-11-07 05:08:07,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375683080]
[2020-11-07 05:08:07,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-11-07 05:08:07,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:07,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-11-07 05:08:07,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2020-11-07 05:08:07,077 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 12 states.
[2020-11-07 05:08:07,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:07,945 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions.
[2020-11-07 05:08:07,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2020-11-07 05:08:07,946 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46
[2020-11-07 05:08:07,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:07,948 INFO L225 Difference]: With dead ends: 49
[2020-11-07 05:08:07,948 INFO L226 Difference]: Without dead ends: 43
[2020-11-07 05:08:07,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600
[2020-11-07 05:08:07,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2020-11-07 05:08:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2020-11-07 05:08:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2020-11-07 05:08:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions.
[2020-11-07 05:08:07,968 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 46
[2020-11-07 05:08:07,968 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:07,968 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions.
[2020-11-07 05:08:07,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-11-07 05:08:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions.
[2020-11-07 05:08:07,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2020-11-07 05:08:07,973 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:07,974 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:07,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-11-07 05:08:07,974 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:07,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:07,975 INFO L82 PathProgramCache]: Analyzing trace with hash -461443027, now seen corresponding path program 4 times
[2020-11-07 05:08:07,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:07,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546691021]
[2020-11-07 05:08:07,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:08,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked.
[2020-11-07 05:08:08,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546691021]
[2020-11-07 05:08:08,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:08,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14
[2020-11-07 05:08:08,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161955944]
[2020-11-07 05:08:08,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-11-07 05:08:08,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-11-07 05:08:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2020-11-07 05:08:08,323 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 14 states.
[2020-11-07 05:08:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:09,293 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions.
[2020-11-07 05:08:09,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states.
[2020-11-07 05:08:09,298 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53
[2020-11-07 05:08:09,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:09,299 INFO L225 Difference]: With dead ends: 53
[2020-11-07 05:08:09,299 INFO L226 Difference]: Without dead ends: 47
[2020-11-07 05:08:09,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=766, Unknown=0, NotChecked=0, Total=870
[2020-11-07 05:08:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2020-11-07 05:08:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2020-11-07 05:08:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states.
[2020-11-07 05:08:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions.
[2020-11-07 05:08:09,314 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 53
[2020-11-07 05:08:09,315 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:09,315 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions.
[2020-11-07 05:08:09,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states.
[2020-11-07 05:08:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions.
[2020-11-07 05:08:09,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2020-11-07 05:08:09,317 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:09,317 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:09,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-11-07 05:08:09,317 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1951577079, now seen corresponding path program 5 times
[2020-11-07 05:08:09,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:09,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749206311]
[2020-11-07 05:08:09,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2020-11-07 05:08:09,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749206311]
[2020-11-07 05:08:09,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:09,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16
[2020-11-07 05:08:09,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903641974]
[2020-11-07 05:08:09,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states
[2020-11-07 05:08:09,669 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2020-11-07 05:08:09,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240
[2020-11-07 05:08:09,670 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 16 states.
[2020-11-07 05:08:10,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:10,823 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions.
[2020-11-07 05:08:10,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2020-11-07 05:08:10,825 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60
[2020-11-07 05:08:10,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:10,826 INFO L225 Difference]: With dead ends: 57
[2020-11-07 05:08:10,826 INFO L226 Difference]: Without dead ends: 51
[2020-11-07 05:08:10,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190
[2020-11-07 05:08:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2020-11-07 05:08:10,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2020-11-07 05:08:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states.
[2020-11-07 05:08:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions.
[2020-11-07 05:08:10,842 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 60
[2020-11-07 05:08:10,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:10,843 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions.
[2020-11-07 05:08:10,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states.
[2020-11-07 05:08:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions.
[2020-11-07 05:08:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2020-11-07 05:08:10,845 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:10,845 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:10,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-11-07 05:08:10,845 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1085586761, now seen corresponding path program 6 times
[2020-11-07 05:08:10,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:10,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [519866657]
[2020-11-07 05:08:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:10,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:10,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:10,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2020-11-07 05:08:11,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [519866657]
[2020-11-07 05:08:11,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:11,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18
[2020-11-07 05:08:11,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79819548]
[2020-11-07 05:08:11,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states
[2020-11-07 05:08:11,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:11,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2020-11-07 05:08:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306
[2020-11-07 05:08:11,280 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 18 states.
[2020-11-07 05:08:12,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:12,644 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions.
[2020-11-07 05:08:12,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2020-11-07 05:08:12,644 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67
[2020-11-07 05:08:12,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:12,649 INFO L225 Difference]: With dead ends: 61
[2020-11-07 05:08:12,651 INFO L226 Difference]: Without dead ends: 55
[2020-11-07 05:08:12,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=142, Invalid=1418, Unknown=0, NotChecked=0, Total=1560
[2020-11-07 05:08:12,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2020-11-07 05:08:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55.
[2020-11-07 05:08:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states.
[2020-11-07 05:08:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions.
[2020-11-07 05:08:12,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 67
[2020-11-07 05:08:12,687 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:12,687 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions.
[2020-11-07 05:08:12,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states.
[2020-11-07 05:08:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions.
[2020-11-07 05:08:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2020-11-07 05:08:12,695 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:12,695 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:12,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2020-11-07 05:08:12,696 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:12,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1506086719, now seen corresponding path program 7 times
[2020-11-07 05:08:12,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:12,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687005047]
[2020-11-07 05:08:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:12,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:12,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:12,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:12,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2020-11-07 05:08:13,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687005047]
[2020-11-07 05:08:13,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:13,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2020-11-07 05:08:13,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142209921]
[2020-11-07 05:08:13,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states
[2020-11-07 05:08:13,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:13,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2020-11-07 05:08:13,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380
[2020-11-07 05:08:13,281 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 20 states.
[2020-11-07 05:08:14,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:14,859 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions.
[2020-11-07 05:08:14,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states.
[2020-11-07 05:08:14,860 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74
[2020-11-07 05:08:14,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:14,862 INFO L225 Difference]: With dead ends: 65
[2020-11-07 05:08:14,862 INFO L226 Difference]: Without dead ends: 59
[2020-11-07 05:08:14,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=161, Invalid=1819, Unknown=0, NotChecked=0, Total=1980
[2020-11-07 05:08:14,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2020-11-07 05:08:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2020-11-07 05:08:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2020-11-07 05:08:14,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions.
[2020-11-07 05:08:14,878 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 74
[2020-11-07 05:08:14,878 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:14,879 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions.
[2020-11-07 05:08:14,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states.
[2020-11-07 05:08:14,879 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions.
[2020-11-07 05:08:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2020-11-07 05:08:14,881 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:14,881 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:14,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2020-11-07 05:08:14,881 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1924014913, now seen corresponding path program 8 times
[2020-11-07 05:08:14,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:14,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [774245568]
[2020-11-07 05:08:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:14,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:14,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked.
[2020-11-07 05:08:15,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [774245568]
[2020-11-07 05:08:15,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:15,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22
[2020-11-07 05:08:15,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011659726]
[2020-11-07 05:08:15,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states
[2020-11-07 05:08:15,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:15,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2020-11-07 05:08:15,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462
[2020-11-07 05:08:15,471 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 22 states.
[2020-11-07 05:08:17,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:17,369 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions.
[2020-11-07 05:08:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states.
[2020-11-07 05:08:17,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 81
[2020-11-07 05:08:17,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:17,371 INFO L225 Difference]: With dead ends: 69
[2020-11-07 05:08:17,371 INFO L226 Difference]: Without dead ends: 63
[2020-11-07 05:08:17,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=2270, Unknown=0, NotChecked=0, Total=2450
[2020-11-07 05:08:17,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2020-11-07 05:08:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63.
[2020-11-07 05:08:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2020-11-07 05:08:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions.
[2020-11-07 05:08:17,386 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 81
[2020-11-07 05:08:17,387 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:17,387 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions.
[2020-11-07 05:08:17,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states.
[2020-11-07 05:08:17,387 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions.
[2020-11-07 05:08:17,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2020-11-07 05:08:17,389 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:17,389 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:17,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2020-11-07 05:08:17,389 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:17,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:17,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1815934069, now seen corresponding path program 9 times
[2020-11-07 05:08:17,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:17,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [958296670]
[2020-11-07 05:08:17,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:17,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2020-11-07 05:08:18,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [958296670]
[2020-11-07 05:08:18,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:18,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24
[2020-11-07 05:08:18,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788601323]
[2020-11-07 05:08:18,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states
[2020-11-07 05:08:18,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:18,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2020-11-07 05:08:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552
[2020-11-07 05:08:18,059 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 24 states.
[2020-11-07 05:08:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:20,202 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions.
[2020-11-07 05:08:20,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2020-11-07 05:08:20,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88
[2020-11-07 05:08:20,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:20,204 INFO L225 Difference]: With dead ends: 73
[2020-11-07 05:08:20,204 INFO L226 Difference]: Without dead ends: 67
[2020-11-07 05:08:20,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=2771, Unknown=0, NotChecked=0, Total=2970
[2020-11-07 05:08:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states.
[2020-11-07 05:08:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67.
[2020-11-07 05:08:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states.
[2020-11-07 05:08:20,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions.
[2020-11-07 05:08:20,220 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 88
[2020-11-07 05:08:20,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:20,221 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions.
[2020-11-07 05:08:20,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2020-11-07 05:08:20,221 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions.
[2020-11-07 05:08:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2020-11-07 05:08:20,223 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:20,223 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:20,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2020-11-07 05:08:20,223 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:20,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1550347829, now seen corresponding path program 10 times
[2020-11-07 05:08:20,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:20,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [364185413]
[2020-11-07 05:08:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:20,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:21,033 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked.
[2020-11-07 05:08:21,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [364185413]
[2020-11-07 05:08:21,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:21,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26
[2020-11-07 05:08:21,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103430578]
[2020-11-07 05:08:21,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states
[2020-11-07 05:08:21,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:21,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2020-11-07 05:08:21,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650
[2020-11-07 05:08:21,036 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 26 states.
[2020-11-07 05:08:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:23,442 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions.
[2020-11-07 05:08:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2020-11-07 05:08:23,443 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 95
[2020-11-07 05:08:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:23,444 INFO L225 Difference]: With dead ends: 77
[2020-11-07 05:08:23,444 INFO L226 Difference]: Without dead ends: 71
[2020-11-07 05:08:23,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=218, Invalid=3322, Unknown=0, NotChecked=0, Total=3540
[2020-11-07 05:08:23,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states.
[2020-11-07 05:08:23,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71.
[2020-11-07 05:08:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states.
[2020-11-07 05:08:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions.
[2020-11-07 05:08:23,466 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 95
[2020-11-07 05:08:23,466 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:23,466 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions.
[2020-11-07 05:08:23,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2020-11-07 05:08:23,466 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions.
[2020-11-07 05:08:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2020-11-07 05:08:23,467 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:23,468 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:23,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2020-11-07 05:08:23,468 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:23,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1156643755, now seen corresponding path program 11 times
[2020-11-07 05:08:23,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:23,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547017886]
[2020-11-07 05:08:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:23,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked.
[2020-11-07 05:08:24,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547017886]
[2020-11-07 05:08:24,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:24,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28
[2020-11-07 05:08:24,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746065847]
[2020-11-07 05:08:24,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states
[2020-11-07 05:08:24,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2020-11-07 05:08:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756
[2020-11-07 05:08:24,389 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 28 states.
[2020-11-07 05:08:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:27,109 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions.
[2020-11-07 05:08:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states.
[2020-11-07 05:08:27,110 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 102
[2020-11-07 05:08:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:27,112 INFO L225 Difference]: With dead ends: 81
[2020-11-07 05:08:27,112 INFO L226 Difference]: Without dead ends: 75
[2020-11-07 05:08:27,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=237, Invalid=3923, Unknown=0, NotChecked=0, Total=4160
[2020-11-07 05:08:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2020-11-07 05:08:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75.
[2020-11-07 05:08:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2020-11-07 05:08:27,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions.
[2020-11-07 05:08:27,131 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 102
[2020-11-07 05:08:27,132 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:27,132 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions.
[2020-11-07 05:08:27,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2020-11-07 05:08:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions.
[2020-11-07 05:08:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2020-11-07 05:08:27,135 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:27,135 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:27,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2020-11-07 05:08:27,136 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1249349205, now seen corresponding path program 12 times
[2020-11-07 05:08:27,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:27,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18182068]
[2020-11-07 05:08:27,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:27,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:28,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:28,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:28,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked.
[2020-11-07 05:08:28,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18182068]
[2020-11-07 05:08:28,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:28,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30
[2020-11-07 05:08:28,271 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628774448]
[2020-11-07 05:08:28,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states
[2020-11-07 05:08:28,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:28,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2020-11-07 05:08:28,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870
[2020-11-07 05:08:28,273 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 30 states.
[2020-11-07 05:08:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:31,432 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions.
[2020-11-07 05:08:31,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states.
[2020-11-07 05:08:31,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 109
[2020-11-07 05:08:31,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:31,435 INFO L225 Difference]: With dead ends: 85
[2020-11-07 05:08:31,435 INFO L226 Difference]: Without dead ends: 79
[2020-11-07 05:08:31,438 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=256, Invalid=4574, Unknown=0, NotChecked=0, Total=4830
[2020-11-07 05:08:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2020-11-07 05:08:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2020-11-07 05:08:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states.
[2020-11-07 05:08:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions.
[2020-11-07 05:08:31,452 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 109
[2020-11-07 05:08:31,452 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:31,452 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions.
[2020-11-07 05:08:31,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2020-11-07 05:08:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions.
[2020-11-07 05:08:31,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2020-11-07 05:08:31,454 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:31,454 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:31,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2020-11-07 05:08:31,455 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:31,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:31,455 INFO L82 PathProgramCache]: Analyzing trace with hash 46324511, now seen corresponding path program 13 times
[2020-11-07 05:08:31,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:31,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029663116]
[2020-11-07 05:08:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:31,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,016 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:32,602 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked.
[2020-11-07 05:08:32,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029663116]
[2020-11-07 05:08:32,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:32,602 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32
[2020-11-07 05:08:32,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018828204]
[2020-11-07 05:08:32,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states
[2020-11-07 05:08:32,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:32,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2020-11-07 05:08:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992
[2020-11-07 05:08:32,606 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 32 states.
[2020-11-07 05:08:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:36,088 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions.
[2020-11-07 05:08:36,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states.
[2020-11-07 05:08:36,089 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 116
[2020-11-07 05:08:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:36,091 INFO L225 Difference]: With dead ends: 89
[2020-11-07 05:08:36,091 INFO L226 Difference]: Without dead ends: 83
[2020-11-07 05:08:36,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=275, Invalid=5275, Unknown=0, NotChecked=0, Total=5550
[2020-11-07 05:08:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2020-11-07 05:08:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83.
[2020-11-07 05:08:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states.
[2020-11-07 05:08:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions.
[2020-11-07 05:08:36,108 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 116
[2020-11-07 05:08:36,109 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:36,109 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions.
[2020-11-07 05:08:36,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states.
[2020-11-07 05:08:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions.
[2020-11-07 05:08:36,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2020-11-07 05:08:36,111 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:36,111 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:36,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2020-11-07 05:08:36,111 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:36,112 INFO L82 PathProgramCache]: Analyzing trace with hash 322836703, now seen corresponding path program 14 times
[2020-11-07 05:08:36,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:36,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1041398514]
[2020-11-07 05:08:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:36,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:37,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:37,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:37,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:37,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked.
[2020-11-07 05:08:37,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1041398514]
[2020-11-07 05:08:37,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:37,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34
[2020-11-07 05:08:37,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373260333]
[2020-11-07 05:08:37,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states
[2020-11-07 05:08:37,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:37,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2020-11-07 05:08:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122
[2020-11-07 05:08:37,527 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 34 states.
[2020-11-07 05:08:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:41,535 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions.
[2020-11-07 05:08:41,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states.
[2020-11-07 05:08:41,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 123
[2020-11-07 05:08:41,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:41,537 INFO L225 Difference]: With dead ends: 93
[2020-11-07 05:08:41,537 INFO L226 Difference]: Without dead ends: 87
[2020-11-07 05:08:41,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=294, Invalid=6026, Unknown=0, NotChecked=0, Total=6320
[2020-11-07 05:08:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2020-11-07 05:08:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2020-11-07 05:08:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2020-11-07 05:08:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions.
[2020-11-07 05:08:41,553 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 123
[2020-11-07 05:08:41,554 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:41,554 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions.
[2020-11-07 05:08:41,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2020-11-07 05:08:41,554 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions.
[2020-11-07 05:08:41,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2020-11-07 05:08:41,556 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:41,556 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:41,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2020-11-07 05:08:41,556 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:41,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1510117353, now seen corresponding path program 15 times
[2020-11-07 05:08:41,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:41,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1348185661]
[2020-11-07 05:08:41,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:41,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:41,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:42,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked.
[2020-11-07 05:08:43,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1348185661]
[2020-11-07 05:08:43,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:43,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36
[2020-11-07 05:08:43,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132774022]
[2020-11-07 05:08:43,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 36 states
[2020-11-07 05:08:43,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2020-11-07 05:08:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260
[2020-11-07 05:08:43,133 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 36 states.
[2020-11-07 05:08:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:47,418 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions.
[2020-11-07 05:08:47,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states.
[2020-11-07 05:08:47,419 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 130
[2020-11-07 05:08:47,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:47,420 INFO L225 Difference]: With dead ends: 97
[2020-11-07 05:08:47,420 INFO L226 Difference]: Without dead ends: 91
[2020-11-07 05:08:47,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=313, Invalid=6827, Unknown=0, NotChecked=0, Total=7140
[2020-11-07 05:08:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2020-11-07 05:08:47,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91.
[2020-11-07 05:08:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2020-11-07 05:08:47,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions.
[2020-11-07 05:08:47,437 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 130
[2020-11-07 05:08:47,438 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:47,438 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions.
[2020-11-07 05:08:47,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states.
[2020-11-07 05:08:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions.
[2020-11-07 05:08:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2020-11-07 05:08:47,443 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:47,444 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:47,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2020-11-07 05:08:47,444 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1118097047, now seen corresponding path program 16 times
[2020-11-07 05:08:47,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:47,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864355201]
[2020-11-07 05:08:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:47,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:48,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:49,134 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked.
[2020-11-07 05:08:49,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864355201]
[2020-11-07 05:08:49,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:49,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38
[2020-11-07 05:08:49,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156859355]
[2020-11-07 05:08:49,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states
[2020-11-07 05:08:49,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2020-11-07 05:08:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406
[2020-11-07 05:08:49,137 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 38 states.
[2020-11-07 05:08:54,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:08:54,286 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions.
[2020-11-07 05:08:54,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2020-11-07 05:08:54,287 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 137
[2020-11-07 05:08:54,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:08:54,289 INFO L225 Difference]: With dead ends: 101
[2020-11-07 05:08:54,290 INFO L226 Difference]: Without dead ends: 95
[2020-11-07 05:08:54,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=332, Invalid=7678, Unknown=0, NotChecked=0, Total=8010
[2020-11-07 05:08:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2020-11-07 05:08:54,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2020-11-07 05:08:54,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2020-11-07 05:08:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions.
[2020-11-07 05:08:54,307 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 137
[2020-11-07 05:08:54,308 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:08:54,308 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions.
[2020-11-07 05:08:54,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2020-11-07 05:08:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions.
[2020-11-07 05:08:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2020-11-07 05:08:54,309 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:08:54,310 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:08:54,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2020-11-07 05:08:54,310 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:08:54,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:08:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1483874995, now seen corresponding path program 17 times
[2020-11-07 05:08:54,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:08:54,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [335912989]
[2020-11-07 05:08:54,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:08:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:08:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:08:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:54,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:55,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:08:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:08:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked.
[2020-11-07 05:08:56,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [335912989]
[2020-11-07 05:08:56,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:08:56,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40
[2020-11-07 05:08:56,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331574148]
[2020-11-07 05:08:56,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states
[2020-11-07 05:08:56,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:08:56,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2020-11-07 05:08:56,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560
[2020-11-07 05:08:56,175 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 40 states.
[2020-11-07 05:09:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:09:01,863 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions.
[2020-11-07 05:09:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states.
[2020-11-07 05:09:01,864 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 144
[2020-11-07 05:09:01,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:09:01,866 INFO L225 Difference]: With dead ends: 105
[2020-11-07 05:09:01,866 INFO L226 Difference]: Without dead ends: 99
[2020-11-07 05:09:01,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1467 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=351, Invalid=8579, Unknown=0, NotChecked=0, Total=8930
[2020-11-07 05:09:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2020-11-07 05:09:01,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2020-11-07 05:09:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states.
[2020-11-07 05:09:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions.
[2020-11-07 05:09:01,881 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 144
[2020-11-07 05:09:01,881 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:09:01,881 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions.
[2020-11-07 05:09:01,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states.
[2020-11-07 05:09:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions.
[2020-11-07 05:09:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2020-11-07 05:09:01,883 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:09:01,883 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:09:01,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2020-11-07 05:09:01,883 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:09:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:09:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2076104691, now seen corresponding path program 18 times
[2020-11-07 05:09:01,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:09:01,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2102032801]
[2020-11-07 05:09:01,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:09:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:01,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:09:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:01,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:09:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:02,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:03,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked.
[2020-11-07 05:09:03,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2102032801]
[2020-11-07 05:09:03,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:09:03,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42
[2020-11-07 05:09:03,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796126422]
[2020-11-07 05:09:03,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states
[2020-11-07 05:09:03,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:09:03,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2020-11-07 05:09:03,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722
[2020-11-07 05:09:03,774 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 42 states.
[2020-11-07 05:09:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:09:09,756 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions.
[2020-11-07 05:09:09,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states.
[2020-11-07 05:09:09,757 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 151
[2020-11-07 05:09:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:09:09,759 INFO L225 Difference]: With dead ends: 109
[2020-11-07 05:09:09,759 INFO L226 Difference]: Without dead ends: 103
[2020-11-07 05:09:09,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=370, Invalid=9530, Unknown=0, NotChecked=0, Total=9900
[2020-11-07 05:09:09,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2020-11-07 05:09:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2020-11-07 05:09:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states.
[2020-11-07 05:09:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions.
[2020-11-07 05:09:09,774 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 151
[2020-11-07 05:09:09,775 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:09:09,775 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions.
[2020-11-07 05:09:09,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2020-11-07 05:09:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions.
[2020-11-07 05:09:09,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2020-11-07 05:09:09,776 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:09:09,776 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:09:09,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2020-11-07 05:09:09,776 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:09:09,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:09:09,777 INFO L82 PathProgramCache]: Analyzing trace with hash -566914179, now seen corresponding path program 19 times
[2020-11-07 05:09:09,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:09:09,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840380610]
[2020-11-07 05:09:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:09:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:09,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-11-07 05:09:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:09,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14
[2020-11-07 05:09:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:09,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:10,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-11-07 05:09:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-11-07 05:09:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1273 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked.
[2020-11-07 05:09:11,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840380610]
[2020-11-07 05:09:11,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences.
[2020-11-07 05:09:11,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44
[2020-11-07 05:09:11,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493814766]
[2020-11-07 05:09:11,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states
[2020-11-07 05:09:11,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-11-07 05:09:11,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2020-11-07 05:09:11,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892
[2020-11-07 05:09:11,939 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 44 states.
[2020-11-07 05:09:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-11-07 05:09:18,576 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions.
[2020-11-07 05:09:18,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states.
[2020-11-07 05:09:18,577 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 158
[2020-11-07 05:09:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-11-07 05:09:18,579 INFO L225 Difference]: With dead ends: 113
[2020-11-07 05:09:18,579 INFO L226 Difference]: Without dead ends: 107
[2020-11-07 05:09:18,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=389, Invalid=10531, Unknown=0, NotChecked=0, Total=10920
[2020-11-07 05:09:18,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2020-11-07 05:09:18,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2020-11-07 05:09:18,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states.
[2020-11-07 05:09:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions.
[2020-11-07 05:09:18,596 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 158
[2020-11-07 05:09:18,596 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-11-07 05:09:18,596 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions.
[2020-11-07 05:09:18,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2020-11-07 05:09:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions.
[2020-11-07 05:09:18,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2020-11-07 05:09:18,597 INFO L414 BasicCegarLoop]: Found error trace
[2020-11-07 05:09:18,597 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-11-07 05:09:18,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2020-11-07 05:09:18,598 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-11-07 05:09:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-11-07 05:09:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1423510653, now seen corresponding path program 20 times
[2020-11-07 05:09:18,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-11-07 05:09:18,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [710512108]
[2020-11-07 05:09:18,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-11-07 05:09:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-07 05:09:18,711 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-07 05:09:18,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-11-07 05:09:18,822 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-11-07 05:09:18,900 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace
[2020-11-07 05:09:18,900 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2020-11-07 05:09:18,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2020-11-07 05:09:19,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:09:19 BoogieIcfgContainer
[2020-11-07 05:09:19,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-11-07 05:09:19,066 INFO L168 Benchmark]: Toolchain (without parser) took 75762.27 ms. Allocated memory was 151.0 MB in the beginning and 476.1 MB in the end (delta: 325.1 MB). Free memory was 127.8 MB in the beginning and 242.8 MB in the end (delta: -115.0 MB). Peak memory consumption was 210.8 MB. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,067 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.53 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 118.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,068 INFO L168 Benchmark]: Boogie Preprocessor took 32.86 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,071 INFO L168 Benchmark]: RCFGBuilder took 331.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 103.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,072 INFO L168 Benchmark]: TraceAbstraction took 75156.90 ms. Allocated memory was 151.0 MB in the beginning and 476.1 MB in the end (delta: 325.1 MB). Free memory was 103.5 MB in the beginning and 242.8 MB in the end (delta: -139.3 MB). Peak memory consumption was 186.7 MB. Max. memory is 8.0 GB.
[2020-11-07 05:09:19,077 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.24 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB.
* CACSL2BoogieTranslator took 229.53 ms. Allocated memory is still 151.0 MB. Free memory was 127.0 MB in the beginning and 118.2 MB in the end (delta: 8.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB.
* Boogie Preprocessor took 32.86 ms. Allocated memory is still 151.0 MB. Free memory was 118.2 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB.
* RCFGBuilder took 331.20 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 103.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB.
* TraceAbstraction took 75156.90 ms. Allocated memory was 151.0 MB in the beginning and 476.1 MB in the end (delta: 325.1 MB). Free memory was 103.5 MB in the beginning and 242.8 MB in the end (delta: -139.3 MB). Peak memory consumption was 186.7 MB. Max. memory is 8.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable
a call of __VERIFIER_error() is reachable
We found a FailurePath:
[L12] unsigned int input = __VERIFIER_nondet_uint();
VAL [__VERIFIER_nondet_uint()=20, input=20]
[L13] CALL, EXPR id(input)
VAL [\old(x)=20]
[L7] COND FALSE !(x==0)
VAL [\old(x)=20, x=20]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=19]
[L7] COND FALSE !(x==0)
VAL [\old(x)=19, x=19]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=18]
[L7] COND FALSE !(x==0)
VAL [\old(x)=18, x=18]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=17]
[L7] COND FALSE !(x==0)
VAL [\old(x)=17, x=17]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=16]
[L7] COND FALSE !(x==0)
VAL [\old(x)=16, x=16]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=15]
[L7] COND FALSE !(x==0)
VAL [\old(x)=15, x=15]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=14]
[L7] COND FALSE !(x==0)
VAL [\old(x)=14, x=14]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=13]
[L7] COND FALSE !(x==0)
VAL [\old(x)=13, x=13]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=12]
[L7] COND FALSE !(x==0)
VAL [\old(x)=12, x=12]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=11]
[L7] COND FALSE !(x==0)
VAL [\old(x)=11, x=11]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=10]
[L7] COND FALSE !(x==0)
VAL [\old(x)=10, x=10]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=9]
[L7] COND FALSE !(x==0)
VAL [\old(x)=9, x=9]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=8]
[L7] COND FALSE !(x==0)
VAL [\old(x)=8, x=8]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=7]
[L7] COND FALSE !(x==0)
VAL [\old(x)=7, x=7]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=6]
[L7] COND FALSE !(x==0)
VAL [\old(x)=6, x=6]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=5]
[L7] COND FALSE !(x==0)
VAL [\old(x)=5, x=5]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=4]
[L7] COND FALSE !(x==0)
VAL [\old(x)=4, x=4]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=3]
[L7] COND FALSE !(x==0)
VAL [\old(x)=3, x=3]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=2]
[L7] COND FALSE !(x==0)
VAL [\old(x)=2, x=2]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=1]
[L7] COND FALSE !(x==0)
VAL [\old(x)=1, x=1]
[L8] CALL, EXPR id(x-1)
VAL [\old(x)=0]
[L7] COND TRUE x==0
VAL [\old(x)=0, x=0]
[L7] return 0;
VAL [\old(x)=0, \result=0, x=0]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=1, id(x-1)=0, x=1]
[L8] return id(x-1) + 1;
VAL [\old(x)=1, \result=1, id(x-1)=0, x=1]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=2, id(x-1)=1, x=2]
[L8] return id(x-1) + 1;
VAL [\old(x)=2, \result=2, id(x-1)=1, x=2]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=3, id(x-1)=2, x=3]
[L8] return id(x-1) + 1;
VAL [\old(x)=3, \result=3, id(x-1)=2, x=3]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=4, id(x-1)=3, x=4]
[L8] return id(x-1) + 1;
VAL [\old(x)=4, \result=4, id(x-1)=3, x=4]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=5, id(x-1)=4, x=5]
[L8] return id(x-1) + 1;
VAL [\old(x)=5, \result=5, id(x-1)=4, x=5]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=6, id(x-1)=5, x=6]
[L8] return id(x-1) + 1;
VAL [\old(x)=6, \result=6, id(x-1)=5, x=6]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=7, id(x-1)=6, x=7]
[L8] return id(x-1) + 1;
VAL [\old(x)=7, \result=7, id(x-1)=6, x=7]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=8, id(x-1)=7, x=8]
[L8] return id(x-1) + 1;
VAL [\old(x)=8, \result=8, id(x-1)=7, x=8]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=9, id(x-1)=8, x=9]
[L8] return id(x-1) + 1;
VAL [\old(x)=9, \result=9, id(x-1)=8, x=9]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=10, id(x-1)=9, x=10]
[L8] return id(x-1) + 1;
VAL [\old(x)=10, \result=10, id(x-1)=9, x=10]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=11, id(x-1)=10, x=11]
[L8] return id(x-1) + 1;
VAL [\old(x)=11, \result=11, id(x-1)=10, x=11]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=12, id(x-1)=11, x=12]
[L8] return id(x-1) + 1;
VAL [\old(x)=12, \result=12, id(x-1)=11, x=12]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=13, id(x-1)=12, x=13]
[L8] return id(x-1) + 1;
VAL [\old(x)=13, \result=13, id(x-1)=12, x=13]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=14, id(x-1)=13, x=14]
[L8] return id(x-1) + 1;
VAL [\old(x)=14, \result=14, id(x-1)=13, x=14]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=15, id(x-1)=14, x=15]
[L8] return id(x-1) + 1;
VAL [\old(x)=15, \result=15, id(x-1)=14, x=15]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=16, id(x-1)=15, x=16]
[L8] return id(x-1) + 1;
VAL [\old(x)=16, \result=16, id(x-1)=15, x=16]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=17, id(x-1)=16, x=17]
[L8] return id(x-1) + 1;
VAL [\old(x)=17, \result=17, id(x-1)=16, x=17]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=18, id(x-1)=17, x=18]
[L8] return id(x-1) + 1;
VAL [\old(x)=18, \result=18, id(x-1)=17, x=18]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=19, id(x-1)=18, x=19]
[L8] return id(x-1) + 1;
VAL [\old(x)=19, \result=19, id(x-1)=18, x=19]
[L8] RET, EXPR id(x-1)
VAL [\old(x)=20, id(x-1)=19, x=20]
[L8] return id(x-1) + 1;
VAL [\old(x)=20, \result=20, id(x-1)=19, x=20]
[L13] RET, EXPR id(input)
VAL [id(input)=20, input=20]
[L13] unsigned int result = id(input);
VAL [id(input)=20, input=20, result=20]
[L14] COND TRUE result == 20
VAL [input=20, result=20]
[L15] CALL reach_error()
[L4] __assert_fail("0", "id_o20.c", 4, "reach_error")
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 74.8s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 54.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 885 SDtfs, 1106 SDslu, 6667 SDs, 0 SdLazy, 27368 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 1110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13020 ImplicationChecksByTransitivity, 45.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 1995 NumberOfCodeBlocks, 1995 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1810 ConstructedInterpolants, 0 QuantifiedInterpolants, 843390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 3800/8740 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 incorrect!
Received shutdown request...