/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:58:04,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:58:04,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:58:04,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:58:04,581 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:58:04,582 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:58:04,583 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:58:04,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:58:04,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:58:04,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:58:04,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:58:04,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:58:04,590 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:58:04,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:58:04,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:58:04,596 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:58:04,596 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:58:04,597 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:58:04,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:58:04,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:58:04,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:58:04,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:58:04,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:58:04,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:58:04,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:58:04,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:58:04,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:58:04,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:58:04,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:58:04,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:58:04,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:58:04,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:58:04,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:58:04,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:58:04,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:58:04,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:58:04,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:58:04,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:58:04,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:58:04,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:58:04,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:58:04,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:58:04,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:58:04,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:58:04,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:58:04,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:58:04,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:58:04,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:58:04,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:58:04,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:58:04,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:58:04,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:04,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:58:04,631 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:58:04,631 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-31 20:58:04,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:58:04,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:58:04,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:58:04,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:58:04,809 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:58:04,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2022-01-31 20:58:04,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9098ea029/3e109349cc2847e9ae9f7bafe567dba6/FLAGa764142f0 [2022-01-31 20:58:05,183 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:58:05,184 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2022-01-31 20:58:05,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9098ea029/3e109349cc2847e9ae9f7bafe567dba6/FLAGa764142f0 [2022-01-31 20:58:05,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9098ea029/3e109349cc2847e9ae9f7bafe567dba6 [2022-01-31 20:58:05,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:58:05,637 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:58:05,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:05,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:58:05,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:58:05,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc2b046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05, skipping insertion in model container [2022-01-31 20:58:05,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:58:05,656 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:58:05,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i[893,906] [2022-01-31 20:58:05,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:05,790 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:58:05,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i[893,906] [2022-01-31 20:58:05,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:05,810 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:58:05,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05 WrapperNode [2022-01-31 20:58:05,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:05,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:58:05,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:58:05,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:58:05,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,827 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:58:05,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:58:05,829 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:58:05,829 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:58:05,830 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (1/1) ... [2022-01-31 20:58:05,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:05,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:58:05,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-31 20:58:05,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:58:05,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:58:05,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:58:05,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:58:05,946 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:58:05,947 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:58:06,051 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:58:06,054 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:58:06,054 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 20:58:06,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:06 BoogieIcfgContainer [2022-01-31 20:58:06,056 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:58:06,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:58:06,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:58:06,059 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:58:06,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:58:05" (1/3) ... [2022-01-31 20:58:06,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251be57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:06, skipping insertion in model container [2022-01-31 20:58:06,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:05" (2/3) ... [2022-01-31 20:58:06,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251be57c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:06, skipping insertion in model container [2022-01-31 20:58:06,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:06" (3/3) ... [2022-01-31 20:58:06,061 INFO L111 eAbstractionObserver]: Analyzing ICFG heapsort.i [2022-01-31 20:58:06,063 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:58:06,064 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:58:06,102 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:58:06,106 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:58:06,106 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:58:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-01-31 20:58:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:06,150 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:06,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:06,150 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:06,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:06,155 INFO L85 PathProgramCache]: Analyzing trace with hash -250128701, now seen corresponding path program 1 times [2022-01-31 20:58:06,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:06,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30887294] [2022-01-31 20:58:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:06,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:06,209 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:06,392 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:06,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30887294] [2022-01-31 20:58:06,394 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [30887294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:06,394 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:06,394 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:06,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814590712] [2022-01-31 20:58:06,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:06,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:06,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:06,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:06,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:06,420 INFO L87 Difference]: Start difference. First operand has 44 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:06,684 INFO L93 Difference]: Finished difference Result 88 states and 148 transitions. [2022-01-31 20:58:06,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:58:06,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:06,692 INFO L225 Difference]: With dead ends: 88 [2022-01-31 20:58:06,692 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 20:58:06,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:06,697 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:06,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 63 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 20:58:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-01-31 20:58:06,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 16 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 20:58:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-01-31 20:58:06,741 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 15 [2022-01-31 20:58:06,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:06,741 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-01-31 20:58:06,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-01-31 20:58:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:06,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:06,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:06,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:58:06,742 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:06,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:06,743 INFO L85 PathProgramCache]: Analyzing trace with hash -254865470, now seen corresponding path program 1 times [2022-01-31 20:58:06,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:06,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899004857] [2022-01-31 20:58:06,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:06,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:06,745 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:06,790 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:06,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899004857] [2022-01-31 20:58:06,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [899004857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:06,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:06,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:06,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193662418] [2022-01-31 20:58:06,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:06,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:06,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:06,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:06,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:06,793 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:07,031 INFO L93 Difference]: Finished difference Result 71 states and 105 transitions. [2022-01-31 20:58:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:58:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:07,037 INFO L225 Difference]: With dead ends: 71 [2022-01-31 20:58:07,038 INFO L226 Difference]: Without dead ends: 69 [2022-01-31 20:58:07,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:07,043 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 57 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:07,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 56 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-31 20:58:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 47. [2022-01-31 20:58:07,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 16 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-01-31 20:58:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2022-01-31 20:58:07,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 15 [2022-01-31 20:58:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:07,066 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-01-31 20:58:07,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2022-01-31 20:58:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:07,067 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:07,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:07,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:58:07,068 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:07,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:07,068 INFO L85 PathProgramCache]: Analyzing trace with hash -216435080, now seen corresponding path program 1 times [2022-01-31 20:58:07,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:07,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [793907851] [2022-01-31 20:58:07,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:07,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:07,070 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:07,114 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:07,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [793907851] [2022-01-31 20:58:07,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [793907851] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:07,115 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:07,115 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:07,115 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113545790] [2022-01-31 20:58:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:07,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:07,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:07,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:07,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:07,116 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:07,351 INFO L93 Difference]: Finished difference Result 80 states and 115 transitions. [2022-01-31 20:58:07,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:07,352 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:58:07,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:07,353 INFO L225 Difference]: With dead ends: 80 [2022-01-31 20:58:07,354 INFO L226 Difference]: Without dead ends: 78 [2022-01-31 20:58:07,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:58:07,355 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 68 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:07,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 65 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:07,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-31 20:58:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 68. [2022-01-31 20:58:07,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2022-01-31 20:58:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2022-01-31 20:58:07,367 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2022-01-31 20:58:07,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:07,367 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2022-01-31 20:58:07,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2022-01-31 20:58:07,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:07,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:07,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:07,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:58:07,368 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:07,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:07,369 INFO L85 PathProgramCache]: Analyzing trace with hash -228679181, now seen corresponding path program 1 times [2022-01-31 20:58:07,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:07,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931668161] [2022-01-31 20:58:07,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:07,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:07,370 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:07,410 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:07,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931668161] [2022-01-31 20:58:07,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [931668161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:07,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:07,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:07,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920172064] [2022-01-31 20:58:07,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:07,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:07,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:07,412 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:07,652 INFO L93 Difference]: Finished difference Result 122 states and 183 transitions. [2022-01-31 20:58:07,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:07,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-01-31 20:58:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:07,653 INFO L225 Difference]: With dead ends: 122 [2022-01-31 20:58:07,653 INFO L226 Difference]: Without dead ends: 120 [2022-01-31 20:58:07,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:58:07,654 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:07,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 56 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-01-31 20:58:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2022-01-31 20:58:07,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 49 states have internal predecessors, (65), 38 states have call successors, (38), 7 states have call predecessors, (38), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-31 20:58:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2022-01-31 20:58:07,670 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 15 [2022-01-31 20:58:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:07,670 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2022-01-31 20:58:07,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2022-01-31 20:58:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:58:07,671 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:07,671 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:07,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:58:07,671 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:07,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:07,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1266022048, now seen corresponding path program 1 times [2022-01-31 20:58:07,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:07,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1558976322] [2022-01-31 20:58:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:07,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:07,673 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:07,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:07,712 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:07,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1558976322] [2022-01-31 20:58:07,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1558976322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:07,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:07,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:07,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982166209] [2022-01-31 20:58:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:07,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:07,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:07,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:07,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 20:58:07,714 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:07,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:07,857 INFO L93 Difference]: Finished difference Result 100 states and 145 transitions. [2022-01-31 20:58:07,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 20:58:07,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 20:58:07,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:07,858 INFO L225 Difference]: With dead ends: 100 [2022-01-31 20:58:07,859 INFO L226 Difference]: Without dead ends: 98 [2022-01-31 20:58:07,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:07,859 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:07,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:07,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-01-31 20:58:07,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-01-31 20:58:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 38 states have call successors, (38), 8 states have call predecessors, (38), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-31 20:58:07,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2022-01-31 20:58:07,874 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 20 [2022-01-31 20:58:07,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:07,874 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2022-01-31 20:58:07,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-01-31 20:58:07,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:58:07,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:07,875 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:07,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 20:58:07,875 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:07,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash 884659585, now seen corresponding path program 1 times [2022-01-31 20:58:07,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:07,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [762197659] [2022-01-31 20:58:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:07,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:07,877 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:07,924 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:07,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [762197659] [2022-01-31 20:58:07,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [762197659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:07,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:07,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:58:07,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248046789] [2022-01-31 20:58:07,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:07,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:58:07,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:07,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:58:07,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:58:07,925 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:08,190 INFO L93 Difference]: Finished difference Result 131 states and 194 transitions. [2022-01-31 20:58:08,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:08,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 20:58:08,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:08,192 INFO L225 Difference]: With dead ends: 131 [2022-01-31 20:58:08,192 INFO L226 Difference]: Without dead ends: 129 [2022-01-31 20:58:08,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:58:08,193 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:08,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 63 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-01-31 20:58:08,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-01-31 20:58:08,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 52 states have call successors, (52), 9 states have call predecessors, (52), 8 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-01-31 20:58:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2022-01-31 20:58:08,216 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 20 [2022-01-31 20:58:08,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:08,216 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2022-01-31 20:58:08,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,216 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2022-01-31 20:58:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:58:08,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:08,217 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:08,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 20:58:08,217 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:08,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1424204299, now seen corresponding path program 1 times [2022-01-31 20:58:08,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:08,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [163080719] [2022-01-31 20:58:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:08,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:08,219 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:08,256 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:08,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [163080719] [2022-01-31 20:58:08,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [163080719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:08,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:08,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:08,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122713837] [2022-01-31 20:58:08,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:08,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:08,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:08,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:08,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:08,258 INFO L87 Difference]: Start difference. First operand 126 states and 189 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:08,477 INFO L93 Difference]: Finished difference Result 188 states and 291 transitions. [2022-01-31 20:58:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:58:08,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 20:58:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:08,480 INFO L225 Difference]: With dead ends: 188 [2022-01-31 20:58:08,480 INFO L226 Difference]: Without dead ends: 186 [2022-01-31 20:58:08,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:58:08,481 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:08,481 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-01-31 20:58:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 162. [2022-01-31 20:58:08,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 81 states have internal predecessors, (101), 76 states have call successors, (76), 10 states have call predecessors, (76), 9 states have return successors, (75), 70 states have call predecessors, (75), 75 states have call successors, (75) [2022-01-31 20:58:08,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 252 transitions. [2022-01-31 20:58:08,509 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 252 transitions. Word has length 20 [2022-01-31 20:58:08,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:08,509 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 252 transitions. [2022-01-31 20:58:08,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 252 transitions. [2022-01-31 20:58:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 20:58:08,510 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:08,510 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:08,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 20:58:08,511 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:08,511 INFO L85 PathProgramCache]: Analyzing trace with hash 297853571, now seen corresponding path program 1 times [2022-01-31 20:58:08,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1931705064] [2022-01-31 20:58:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:08,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:08,512 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:08,531 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:08,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1931705064] [2022-01-31 20:58:08,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1931705064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:08,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:08,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 20:58:08,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225267091] [2022-01-31 20:58:08,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:08,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 20:58:08,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:08,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 20:58:08,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 20:58:08,533 INFO L87 Difference]: Start difference. First operand 162 states and 252 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:08,658 INFO L93 Difference]: Finished difference Result 329 states and 524 transitions. [2022-01-31 20:58:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 20:58:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-01-31 20:58:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:08,660 INFO L225 Difference]: With dead ends: 329 [2022-01-31 20:58:08,660 INFO L226 Difference]: Without dead ends: 239 [2022-01-31 20:58:08,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:58:08,661 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 39 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:08,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 63 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-01-31 20:58:08,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 209. [2022-01-31 20:58:08,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 101 states have internal predecessors, (129), 104 states have call successors, (104), 10 states have call predecessors, (104), 9 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2022-01-31 20:58:08,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2022-01-31 20:58:08,692 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 20 [2022-01-31 20:58:08,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:08,692 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2022-01-31 20:58:08,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:08,693 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2022-01-31 20:58:08,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-31 20:58:08,693 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:08,693 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:08,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 20:58:08,694 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash 288094237, now seen corresponding path program 1 times [2022-01-31 20:58:08,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:08,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094553617] [2022-01-31 20:58:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:08,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:08,695 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:08,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:08,756 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094553617] [2022-01-31 20:58:08,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2094553617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:08,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:08,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:08,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154689160] [2022-01-31 20:58:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:08,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:08,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:08,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:08,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:08,758 INFO L87 Difference]: Start difference. First operand 209 states and 336 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 20:58:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:09,038 INFO L93 Difference]: Finished difference Result 275 states and 448 transitions. [2022-01-31 20:58:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:09,038 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-01-31 20:58:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:09,041 INFO L225 Difference]: With dead ends: 275 [2022-01-31 20:58:09,043 INFO L226 Difference]: Without dead ends: 273 [2022-01-31 20:58:09,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:58:09,045 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:09,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 61 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-01-31 20:58:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2022-01-31 20:58:09,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 114 states have (on average 1.3859649122807018) internal successors, (158), 124 states have internal predecessors, (158), 124 states have call successors, (124), 11 states have call predecessors, (124), 10 states have return successors, (123), 113 states have call predecessors, (123), 123 states have call successors, (123) [2022-01-31 20:58:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 405 transitions. [2022-01-31 20:58:09,095 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 405 transitions. Word has length 27 [2022-01-31 20:58:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:09,095 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 405 transitions. [2022-01-31 20:58:09,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 20:58:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 405 transitions. [2022-01-31 20:58:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-31 20:58:09,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:09,096 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:09,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 20:58:09,096 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash -870562259, now seen corresponding path program 1 times [2022-01-31 20:58:09,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:09,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316404621] [2022-01-31 20:58:09,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:09,246 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:09,246 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:09,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:09,579 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:09,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316404621] [2022-01-31 20:58:09,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [316404621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:09,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:09,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 20:58:09,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759238892] [2022-01-31 20:58:09,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:09,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 20:58:09,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:09,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 20:58:09,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-01-31 20:58:09,580 INFO L87 Difference]: Start difference. First operand 249 states and 405 transitions. Second operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:10,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:10,425 INFO L93 Difference]: Finished difference Result 418 states and 662 transitions. [2022-01-31 20:58:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 20:58:10,426 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-01-31 20:58:10,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:10,430 INFO L225 Difference]: With dead ends: 418 [2022-01-31 20:58:10,430 INFO L226 Difference]: Without dead ends: 342 [2022-01-31 20:58:10,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2022-01-31 20:58:10,433 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 231 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:10,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 86 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 662 Invalid, 0 Unknown, 182 Unchecked, 0.5s Time] [2022-01-31 20:58:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-01-31 20:58:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 264. [2022-01-31 20:58:10,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 124 states have (on average 1.346774193548387) internal successors, (167), 134 states have internal predecessors, (167), 126 states have call successors, (126), 14 states have call predecessors, (126), 13 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-01-31 20:58:10,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 418 transitions. [2022-01-31 20:58:10,494 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 418 transitions. Word has length 29 [2022-01-31 20:58:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:10,495 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 418 transitions. [2022-01-31 20:58:10,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:10,496 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 418 transitions. [2022-01-31 20:58:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 20:58:10,499 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:10,500 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:10,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 20:58:10,500 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:10,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1319777776, now seen corresponding path program 1 times [2022-01-31 20:58:10,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:10,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311272373] [2022-01-31 20:58:10,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:10,501 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:10,502 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:10,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:10,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:10,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:10,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:10,561 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311272373] [2022-01-31 20:58:10,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1311272373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:10,562 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:10,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 20:58:10,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304655817] [2022-01-31 20:58:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:10,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 20:58:10,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:10,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 20:58:10,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:10,563 INFO L87 Difference]: Start difference. First operand 264 states and 418 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 20:58:10,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:10,802 INFO L93 Difference]: Finished difference Result 340 states and 538 transitions. [2022-01-31 20:58:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 20:58:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-01-31 20:58:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:10,805 INFO L225 Difference]: With dead ends: 340 [2022-01-31 20:58:10,805 INFO L226 Difference]: Without dead ends: 338 [2022-01-31 20:58:10,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 20:58:10,806 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:10,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 75 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-01-31 20:58:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 316. [2022-01-31 20:58:10,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 142 states have (on average 1.3450704225352113) internal successors, (191), 158 states have internal predecessors, (191), 158 states have call successors, (158), 16 states have call predecessors, (158), 15 states have return successors, (157), 141 states have call predecessors, (157), 157 states have call successors, (157) [2022-01-31 20:58:10,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 506 transitions. [2022-01-31 20:58:10,890 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 506 transitions. Word has length 30 [2022-01-31 20:58:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:10,890 INFO L470 AbstractCegarLoop]: Abstraction has 316 states and 506 transitions. [2022-01-31 20:58:10,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 20:58:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 506 transitions. [2022-01-31 20:58:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 20:58:10,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:10,892 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2022-01-31 20:58:10,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 20:58:10,893 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:10,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash 826479959, now seen corresponding path program 1 times [2022-01-31 20:58:10,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:10,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [883787510] [2022-01-31 20:58:10,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:10,983 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:10,984 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:10,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:11,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:11,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:11,249 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:11,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [883787510] [2022-01-31 20:58:11,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [883787510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:11,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:11,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 20:58:11,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866426426] [2022-01-31 20:58:11,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:11,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 20:58:11,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:11,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 20:58:11,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-31 20:58:11,251 INFO L87 Difference]: Start difference. First operand 316 states and 506 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 20:58:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:12,427 INFO L93 Difference]: Finished difference Result 1006 states and 1678 transitions. [2022-01-31 20:58:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 20:58:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-01-31 20:58:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:12,435 INFO L225 Difference]: With dead ends: 1006 [2022-01-31 20:58:12,435 INFO L226 Difference]: Without dead ends: 908 [2022-01-31 20:58:12,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2022-01-31 20:58:12,437 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 462 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 563 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:12,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 81 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 1068 Invalid, 0 Unknown, 563 Unchecked, 0.8s Time] [2022-01-31 20:58:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-01-31 20:58:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 632. [2022-01-31 20:58:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 274 states have (on average 1.416058394160584) internal successors, (388), 309 states have internal predecessors, (388), 338 states have call successors, (338), 20 states have call predecessors, (338), 19 states have return successors, (337), 302 states have call predecessors, (337), 337 states have call successors, (337) [2022-01-31 20:58:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1063 transitions. [2022-01-31 20:58:12,557 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1063 transitions. Word has length 41 [2022-01-31 20:58:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:12,557 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 1063 transitions. [2022-01-31 20:58:12,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-01-31 20:58:12,557 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1063 transitions. [2022-01-31 20:58:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 20:58:12,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:12,559 INFO L514 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1] [2022-01-31 20:58:12,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 20:58:12,559 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:12,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:12,559 INFO L85 PathProgramCache]: Analyzing trace with hash 154781133, now seen corresponding path program 1 times [2022-01-31 20:58:12,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:12,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1320032299] [2022-01-31 20:58:12,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:12,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:12,563 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:12,638 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:12,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1320032299] [2022-01-31 20:58:12,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1320032299] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:12,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:12,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:58:12,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273961563] [2022-01-31 20:58:12,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:12,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:58:12,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:58:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:58:12,639 INFO L87 Difference]: Start difference. First operand 632 states and 1063 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-31 20:58:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:13,005 INFO L93 Difference]: Finished difference Result 693 states and 1145 transitions. [2022-01-31 20:58:13,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:13,005 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-01-31 20:58:13,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:13,009 INFO L225 Difference]: With dead ends: 693 [2022-01-31 20:58:13,009 INFO L226 Difference]: Without dead ends: 691 [2022-01-31 20:58:13,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:58:13,010 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:13,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 78 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 20:58:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-01-31 20:58:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 636. [2022-01-31 20:58:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 277 states have (on average 1.4115523465703972) internal successors, (391), 312 states have internal predecessors, (391), 338 states have call successors, (338), 21 states have call predecessors, (338), 20 states have return successors, (337), 302 states have call predecessors, (337), 337 states have call successors, (337) [2022-01-31 20:58:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1066 transitions. [2022-01-31 20:58:13,108 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1066 transitions. Word has length 42 [2022-01-31 20:58:13,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:13,109 INFO L470 AbstractCegarLoop]: Abstraction has 636 states and 1066 transitions. [2022-01-31 20:58:13,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-01-31 20:58:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1066 transitions. [2022-01-31 20:58:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 20:58:13,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:13,110 INFO L514 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:13,110 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 20:58:13,110 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -108519480, now seen corresponding path program 1 times [2022-01-31 20:58:13,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594306829] [2022-01-31 20:58:13,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:13,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:13,112 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:13,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 20:58:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:13,222 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:13,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594306829] [2022-01-31 20:58:13,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594306829] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:13,222 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:13,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:13,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715980903] [2022-01-31 20:58:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:13,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:13,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:13,223 INFO L87 Difference]: Start difference. First operand 636 states and 1066 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 20:58:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:13,737 INFO L93 Difference]: Finished difference Result 771 states and 1282 transitions. [2022-01-31 20:58:13,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:58:13,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-01-31 20:58:13,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:13,741 INFO L225 Difference]: With dead ends: 771 [2022-01-31 20:58:13,741 INFO L226 Difference]: Without dead ends: 769 [2022-01-31 20:58:13,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:58:13,742 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 75 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:13,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 90 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:58:13,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-01-31 20:58:13,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 739. [2022-01-31 20:58:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 321 states have (on average 1.4080996884735202) internal successors, (452), 363 states have internal predecessors, (452), 394 states have call successors, (394), 24 states have call predecessors, (394), 23 states have return successors, (393), 351 states have call predecessors, (393), 393 states have call successors, (393) [2022-01-31 20:58:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1239 transitions. [2022-01-31 20:58:13,902 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1239 transitions. Word has length 54 [2022-01-31 20:58:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:13,902 INFO L470 AbstractCegarLoop]: Abstraction has 739 states and 1239 transitions. [2022-01-31 20:58:13,902 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 20:58:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1239 transitions. [2022-01-31 20:58:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 20:58:13,903 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:13,903 INFO L514 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:13,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 20:58:13,904 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash -461607862, now seen corresponding path program 1 times [2022-01-31 20:58:13,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:13,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1068794479] [2022-01-31 20:58:13,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:13,904 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:13,905 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:13,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 20:58:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-31 20:58:13,969 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1068794479] [2022-01-31 20:58:13,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1068794479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:13,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:13,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:13,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876987467] [2022-01-31 20:58:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:13,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:13,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:13,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:13,970 INFO L87 Difference]: Start difference. First operand 739 states and 1239 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 20:58:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:14,455 INFO L93 Difference]: Finished difference Result 764 states and 1269 transitions. [2022-01-31 20:58:14,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:58:14,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2022-01-31 20:58:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:14,460 INFO L225 Difference]: With dead ends: 764 [2022-01-31 20:58:14,460 INFO L226 Difference]: Without dead ends: 762 [2022-01-31 20:58:14,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:58:14,462 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 62 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:14,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 95 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:58:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-01-31 20:58:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 748. [2022-01-31 20:58:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 327 states have (on average 1.400611620795107) internal successors, (458), 369 states have internal predecessors, (458), 395 states have call successors, (395), 26 states have call predecessors, (395), 25 states have return successors, (394), 352 states have call predecessors, (394), 394 states have call successors, (394) [2022-01-31 20:58:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1247 transitions. [2022-01-31 20:58:14,642 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1247 transitions. Word has length 54 [2022-01-31 20:58:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:14,643 INFO L470 AbstractCegarLoop]: Abstraction has 748 states and 1247 transitions. [2022-01-31 20:58:14,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 20:58:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1247 transitions. [2022-01-31 20:58:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 20:58:14,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:14,644 INFO L514 BasicCegarLoop]: trace histogram [9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:14,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 20:58:14,644 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1001616427, now seen corresponding path program 1 times [2022-01-31 20:58:14,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:14,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223715993] [2022-01-31 20:58:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:14,715 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:14,715 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:14,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 20:58:14,802 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:14,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223715993] [2022-01-31 20:58:14,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [223715993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:14,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:14,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:14,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909578863] [2022-01-31 20:58:14,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:14,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:14,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:14,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:14,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:14,803 INFO L87 Difference]: Start difference. First operand 748 states and 1247 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 20:58:15,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:15,403 INFO L93 Difference]: Finished difference Result 1338 states and 2217 transitions. [2022-01-31 20:58:15,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 20:58:15,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 63 [2022-01-31 20:58:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:15,408 INFO L225 Difference]: With dead ends: 1338 [2022-01-31 20:58:15,409 INFO L226 Difference]: Without dead ends: 901 [2022-01-31 20:58:15,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-01-31 20:58:15,410 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 131 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:15,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 53 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:58:15,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-01-31 20:58:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 769. [2022-01-31 20:58:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 342 states have (on average 1.3801169590643274) internal successors, (472), 385 states have internal predecessors, (472), 396 states have call successors, (396), 31 states have call predecessors, (396), 30 states have return successors, (395), 352 states have call predecessors, (395), 395 states have call successors, (395) [2022-01-31 20:58:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1263 transitions. [2022-01-31 20:58:15,566 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1263 transitions. Word has length 63 [2022-01-31 20:58:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:15,566 INFO L470 AbstractCegarLoop]: Abstraction has 769 states and 1263 transitions. [2022-01-31 20:58:15,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (11), 4 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 20:58:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1263 transitions. [2022-01-31 20:58:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 20:58:15,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:15,567 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:15,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 20:58:15,567 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 820904785, now seen corresponding path program 1 times [2022-01-31 20:58:15,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:15,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [664066460] [2022-01-31 20:58:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:15,571 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:58:15,571 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-01-31 20:58:15,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:15,572 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 20:58:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 20:58:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 20:58:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 20:58:15,630 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:15,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [664066460] [2022-01-31 20:58:15,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [664066460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:15,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:15,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:15,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721004417] [2022-01-31 20:58:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:15,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:15,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:15,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:15,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:15,631 INFO L87 Difference]: Start difference. First operand 769 states and 1263 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 20:58:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:16,208 INFO L93 Difference]: Finished difference Result 939 states and 1543 transitions. [2022-01-31 20:58:16,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:58:16,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 67 [2022-01-31 20:58:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:16,213 INFO L225 Difference]: With dead ends: 939 [2022-01-31 20:58:16,213 INFO L226 Difference]: Without dead ends: 937 [2022-01-31 20:58:16,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:58:16,214 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 122 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:16,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 87 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 20:58:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2022-01-31 20:58:16,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 842. [2022-01-31 20:58:16,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 368 states have (on average 1.372282608695652) internal successors, (505), 416 states have internal predecessors, (505), 439 states have call successors, (439), 35 states have call predecessors, (439), 34 states have return successors, (438), 390 states have call predecessors, (438), 438 states have call successors, (438) [2022-01-31 20:58:16,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1382 transitions. [2022-01-31 20:58:16,380 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1382 transitions. Word has length 67 [2022-01-31 20:58:16,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:16,381 INFO L470 AbstractCegarLoop]: Abstraction has 842 states and 1382 transitions. [2022-01-31 20:58:16,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 20:58:16,381 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1382 transitions. [2022-01-31 20:58:16,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 20:58:16,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:16,382 INFO L514 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:16,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 20:58:16,382 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:16,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1022728719, now seen corresponding path program 1 times [2022-01-31 20:58:16,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:16,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [656419512] [2022-01-31 20:58:16,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:16,387 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:58:16,388 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-01-31 20:58:16,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:16,389 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 20:58:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 20:58:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 20:58:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 20:58:16,437 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:16,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [656419512] [2022-01-31 20:58:16,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [656419512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:16,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:16,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 20:58:16,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350849485] [2022-01-31 20:58:16,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:16,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 20:58:16,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:16,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 20:58:16,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 20:58:16,438 INFO L87 Difference]: Start difference. First operand 842 states and 1382 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 20:58:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:16,660 INFO L93 Difference]: Finished difference Result 897 states and 1424 transitions. [2022-01-31 20:58:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 20:58:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-01-31 20:58:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:16,664 INFO L225 Difference]: With dead ends: 897 [2022-01-31 20:58:16,665 INFO L226 Difference]: Without dead ends: 742 [2022-01-31 20:58:16,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:16,666 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:16,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 54 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2022-01-31 20:58:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 737. [2022-01-31 20:58:16,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 324 states have (on average 1.367283950617284) internal successors, (443), 364 states have internal predecessors, (443), 381 states have call successors, (381), 32 states have call predecessors, (381), 31 states have return successors, (380), 340 states have call predecessors, (380), 380 states have call successors, (380) [2022-01-31 20:58:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1204 transitions. [2022-01-31 20:58:16,809 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1204 transitions. Word has length 67 [2022-01-31 20:58:16,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:16,809 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 1204 transitions. [2022-01-31 20:58:16,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 20:58:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1204 transitions. [2022-01-31 20:58:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-01-31 20:58:16,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:16,810 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:16,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 20:58:16,810 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:16,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 152819220, now seen corresponding path program 1 times [2022-01-31 20:58:16,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:16,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1601488712] [2022-01-31 20:58:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:16,979 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:16,980 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:16,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-31 20:58:17,431 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:17,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1601488712] [2022-01-31 20:58:17,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1601488712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:17,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:17,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 20:58:17,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351836475] [2022-01-31 20:58:17,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:17,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 20:58:17,432 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:17,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 20:58:17,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-01-31 20:58:17,432 INFO L87 Difference]: Start difference. First operand 737 states and 1204 transitions. Second operand has 24 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-01-31 20:58:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:18,372 INFO L93 Difference]: Finished difference Result 838 states and 1328 transitions. [2022-01-31 20:58:18,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-31 20:58:18,373 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 76 [2022-01-31 20:58:18,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:18,376 INFO L225 Difference]: With dead ends: 838 [2022-01-31 20:58:18,377 INFO L226 Difference]: Without dead ends: 836 [2022-01-31 20:58:18,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=2091, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 20:58:18,378 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:18,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 113 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 1108 Invalid, 0 Unknown, 190 Unchecked, 0.5s Time] [2022-01-31 20:58:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-01-31 20:58:18,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 788. [2022-01-31 20:58:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 358 states have (on average 1.3379888268156424) internal successors, (479), 400 states have internal predecessors, (479), 388 states have call successors, (388), 42 states have call predecessors, (388), 41 states have return successors, (387), 345 states have call predecessors, (387), 387 states have call successors, (387) [2022-01-31 20:58:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1254 transitions. [2022-01-31 20:58:18,517 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1254 transitions. Word has length 76 [2022-01-31 20:58:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:18,517 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 1254 transitions. [2022-01-31 20:58:18,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 1.7) internal successors, (34), 16 states have internal predecessors, (34), 6 states have call successors, (13), 6 states have call predecessors, (13), 4 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2022-01-31 20:58:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1254 transitions. [2022-01-31 20:58:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-31 20:58:18,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:18,518 INFO L514 BasicCegarLoop]: trace histogram [13, 12, 12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:18,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 20:58:18,518 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1858540084, now seen corresponding path program 1 times [2022-01-31 20:58:18,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:18,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920944479] [2022-01-31 20:58:18,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:18,524 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:58:18,524 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-01-31 20:58:18,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:18,525 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 20:58:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 20:58:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 20:58:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 20:58:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-31 20:58:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 20:58:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 20:58:18,584 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920944479] [2022-01-31 20:58:18,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [920944479] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:18,584 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:18,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:18,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704226760] [2022-01-31 20:58:18,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:18,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:18,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:18,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:18,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:18,585 INFO L87 Difference]: Start difference. First operand 788 states and 1254 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 20:58:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:19,169 INFO L93 Difference]: Finished difference Result 833 states and 1323 transitions. [2022-01-31 20:58:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 20:58:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 84 [2022-01-31 20:58:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:19,174 INFO L225 Difference]: With dead ends: 833 [2022-01-31 20:58:19,174 INFO L226 Difference]: Without dead ends: 831 [2022-01-31 20:58:19,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-01-31 20:58:19,175 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 84 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:19,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 99 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 20:58:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2022-01-31 20:58:19,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 792. [2022-01-31 20:58:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 361 states have (on average 1.335180055401662) internal successors, (482), 403 states have internal predecessors, (482), 388 states have call successors, (388), 43 states have call predecessors, (388), 42 states have return successors, (387), 345 states have call predecessors, (387), 387 states have call successors, (387) [2022-01-31 20:58:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1257 transitions. [2022-01-31 20:58:19,345 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1257 transitions. Word has length 84 [2022-01-31 20:58:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:19,345 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 1257 transitions. [2022-01-31 20:58:19,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 4 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 20:58:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1257 transitions. [2022-01-31 20:58:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 20:58:19,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:19,346 INFO L514 BasicCegarLoop]: trace histogram [14, 13, 13, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:19,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 20:58:19,347 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -578278577, now seen corresponding path program 2 times [2022-01-31 20:58:19,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307230190] [2022-01-31 20:58:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:19,353 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:58:19,353 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-01-31 20:58:19,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:19,354 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 20:58:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 20:58:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 20:58:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 20:58:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 20:58:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-31 20:58:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-01-31 20:58:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 20:58:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 20:58:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-31 20:58:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-31 20:58:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 20:58:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 20:58:19,433 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:19,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307230190] [2022-01-31 20:58:19,433 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1307230190] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:19,433 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:19,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 20:58:19,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640218301] [2022-01-31 20:58:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:19,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 20:58:19,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 20:58:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-31 20:58:19,434 INFO L87 Difference]: Start difference. First operand 792 states and 1257 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-31 20:58:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:19,769 INFO L93 Difference]: Finished difference Result 828 states and 1301 transitions. [2022-01-31 20:58:19,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 20:58:19,769 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 89 [2022-01-31 20:58:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:19,774 INFO L225 Difference]: With dead ends: 828 [2022-01-31 20:58:19,774 INFO L226 Difference]: Without dead ends: 711 [2022-01-31 20:58:19,775 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-01-31 20:58:19,775 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:19,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 64 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2022-01-31 20:58:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 671. [2022-01-31 20:58:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 311 states have (on average 1.3279742765273312) internal successors, (413), 346 states have internal predecessors, (413), 321 states have call successors, (321), 39 states have call predecessors, (321), 38 states have return successors, (320), 285 states have call predecessors, (320), 320 states have call successors, (320) [2022-01-31 20:58:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1054 transitions. [2022-01-31 20:58:19,910 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1054 transitions. Word has length 89 [2022-01-31 20:58:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:19,911 INFO L470 AbstractCegarLoop]: Abstraction has 671 states and 1054 transitions. [2022-01-31 20:58:19,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-01-31 20:58:19,911 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1054 transitions. [2022-01-31 20:58:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-31 20:58:19,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:19,923 INFO L514 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:19,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 20:58:19,923 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash -560912485, now seen corresponding path program 1 times [2022-01-31 20:58:19,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:19,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2066427456] [2022-01-31 20:58:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:20,089 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:20,090 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:20,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 20:58:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 20:58:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 20:58:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 20:58:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-01-31 20:58:20,577 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2066427456] [2022-01-31 20:58:20,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2066427456] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:20,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:20,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 20:58:20,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433527447] [2022-01-31 20:58:20,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:20,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 20:58:20,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:20,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 20:58:20,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:58:20,579 INFO L87 Difference]: Start difference. First operand 671 states and 1054 transitions. Second operand has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-01-31 20:58:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:22,418 INFO L93 Difference]: Finished difference Result 898 states and 1383 transitions. [2022-01-31 20:58:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-31 20:58:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 111 [2022-01-31 20:58:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:22,428 INFO L225 Difference]: With dead ends: 898 [2022-01-31 20:58:22,428 INFO L226 Difference]: Without dead ends: 896 [2022-01-31 20:58:22,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1603 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=645, Invalid=4047, Unknown=0, NotChecked=0, Total=4692 [2022-01-31 20:58:22,429 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 172 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 534 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:22,429 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 160 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2293 Invalid, 0 Unknown, 534 Unchecked, 1.0s Time] [2022-01-31 20:58:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-01-31 20:58:22,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 755. [2022-01-31 20:58:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 358 states have (on average 1.312849162011173) internal successors, (470), 392 states have internal predecessors, (470), 349 states have call successors, (349), 48 states have call predecessors, (349), 47 states have return successors, (348), 314 states have call predecessors, (348), 348 states have call successors, (348) [2022-01-31 20:58:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1167 transitions. [2022-01-31 20:58:22,561 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1167 transitions. Word has length 111 [2022-01-31 20:58:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:22,561 INFO L470 AbstractCegarLoop]: Abstraction has 755 states and 1167 transitions. [2022-01-31 20:58:22,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 7 states have call successors, (19), 6 states have call predecessors, (19), 4 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-01-31 20:58:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1167 transitions. [2022-01-31 20:58:22,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 20:58:22,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:22,564 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:22,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 20:58:22,564 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:22,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1794256103, now seen corresponding path program 2 times [2022-01-31 20:58:22,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:22,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587758679] [2022-01-31 20:58:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:22,701 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:22,701 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:22,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 20:58:22,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 20:58:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 20:58:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 20:58:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 20:58:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 20:58:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 20:58:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 20:58:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 20:58:23,220 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:23,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587758679] [2022-01-31 20:58:23,220 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587758679] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:23,220 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:23,220 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 20:58:23,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068629653] [2022-01-31 20:58:23,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:23,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 20:58:23,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 20:58:23,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:58:23,221 INFO L87 Difference]: Start difference. First operand 755 states and 1167 transitions. Second operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-31 20:58:24,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:24,336 INFO L93 Difference]: Finished difference Result 1712 states and 2852 transitions. [2022-01-31 20:58:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-31 20:58:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) Word has length 133 [2022-01-31 20:58:24,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:24,345 INFO L225 Difference]: With dead ends: 1712 [2022-01-31 20:58:24,345 INFO L226 Difference]: Without dead ends: 1710 [2022-01-31 20:58:24,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 8 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=489, Invalid=2933, Unknown=0, NotChecked=0, Total=3422 [2022-01-31 20:58:24,347 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 212 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:24,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 111 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 984 Invalid, 0 Unknown, 192 Unchecked, 0.4s Time] [2022-01-31 20:58:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-01-31 20:58:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1291. [2022-01-31 20:58:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 572 states have (on average 1.382867132867133) internal successors, (791), 635 states have internal predecessors, (791), 668 states have call successors, (668), 52 states have call predecessors, (668), 50 states have return successors, (667), 603 states have call predecessors, (667), 667 states have call successors, (667) [2022-01-31 20:58:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 2126 transitions. [2022-01-31 20:58:24,626 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 2126 transitions. Word has length 133 [2022-01-31 20:58:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:24,628 INFO L470 AbstractCegarLoop]: Abstraction has 1291 states and 2126 transitions. [2022-01-31 20:58:24,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 18 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-31 20:58:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2126 transitions. [2022-01-31 20:58:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-01-31 20:58:24,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:24,630 INFO L514 BasicCegarLoop]: trace histogram [21, 20, 20, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:24,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 20:58:24,632 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:24,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -907033257, now seen corresponding path program 1 times [2022-01-31 20:58:24,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:24,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [485246777] [2022-01-31 20:58:24,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:24,828 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:24,829 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:24,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:24,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 20:58:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 20:58:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 20:58:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 20:58:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-01-31 20:58:24,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-01-31 20:58:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 20:58:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 20:58:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:24,924 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-31 20:58:25,337 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:25,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [485246777] [2022-01-31 20:58:25,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [485246777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:25,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:25,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 20:58:25,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115086830] [2022-01-31 20:58:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:25,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 20:58:25,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 20:58:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:58:25,338 INFO L87 Difference]: Start difference. First operand 1291 states and 2126 transitions. Second operand has 25 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 17 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-31 20:58:26,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:26,440 INFO L93 Difference]: Finished difference Result 1783 states and 2946 transitions. [2022-01-31 20:58:26,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-31 20:58:26,440 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 17 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) Word has length 133 [2022-01-31 20:58:26,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:26,449 INFO L225 Difference]: With dead ends: 1783 [2022-01-31 20:58:26,450 INFO L226 Difference]: Without dead ends: 1781 [2022-01-31 20:58:26,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 10 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=2397, Unknown=0, NotChecked=0, Total=2756 [2022-01-31 20:58:26,451 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 159 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:26,452 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 148 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 726 Invalid, 0 Unknown, 162 Unchecked, 0.4s Time] [2022-01-31 20:58:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-01-31 20:58:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1611. [2022-01-31 20:58:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1611 states, 712 states have (on average 1.3876404494382022) internal successors, (988), 794 states have internal predecessors, (988), 838 states have call successors, (838), 62 states have call predecessors, (838), 60 states have return successors, (837), 754 states have call predecessors, (837), 837 states have call successors, (837) [2022-01-31 20:58:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 2663 transitions. [2022-01-31 20:58:26,805 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 2663 transitions. Word has length 133 [2022-01-31 20:58:26,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:26,805 INFO L470 AbstractCegarLoop]: Abstraction has 1611 states and 2663 transitions. [2022-01-31 20:58:26,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 17 states have internal predecessors, (41), 7 states have call successors, (23), 6 states have call predecessors, (23), 4 states have return successors, (21), 7 states have call predecessors, (21), 7 states have call successors, (21) [2022-01-31 20:58:26,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 2663 transitions. [2022-01-31 20:58:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-01-31 20:58:26,810 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:26,810 INFO L514 BasicCegarLoop]: trace histogram [23, 22, 22, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:26,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 20:58:26,810 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:26,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:26,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1930055884, now seen corresponding path program 3 times [2022-01-31 20:58:26,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:26,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [531175593] [2022-01-31 20:58:26,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:26,938 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:26,939 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:26,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:26,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:26,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 20:58:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 20:58:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-01-31 20:58:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-31 20:58:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 20:58:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-31 20:58:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 20:58:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 20:58:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-01-31 20:58:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-01-31 20:58:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-01-31 20:58:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-01-31 20:58:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-31 20:58:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 20:58:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-31 20:58:27,410 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:27,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [531175593] [2022-01-31 20:58:27,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [531175593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:27,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:27,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-01-31 20:58:27,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567141811] [2022-01-31 20:58:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:27,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 20:58:27,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:27,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 20:58:27,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702 [2022-01-31 20:58:27,412 INFO L87 Difference]: Start difference. First operand 1611 states and 2663 transitions. Second operand has 26 states, 22 states have (on average 2.0) internal successors, (44), 18 states have internal predecessors, (44), 8 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2022-01-31 20:58:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:29,728 INFO L93 Difference]: Finished difference Result 2827 states and 4718 transitions. [2022-01-31 20:58:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-31 20:58:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 18 states have internal predecessors, (44), 8 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 146 [2022-01-31 20:58:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:29,758 INFO L225 Difference]: With dead ends: 2827 [2022-01-31 20:58:29,758 INFO L226 Difference]: Without dead ends: 2825 [2022-01-31 20:58:29,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=803, Invalid=5839, Unknown=0, NotChecked=0, Total=6642 [2022-01-31 20:58:29,760 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 302 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 3547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 576 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:29,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 196 Invalid, 3547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 2344 Invalid, 0 Unknown, 576 Unchecked, 1.0s Time] [2022-01-31 20:58:29,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states. [2022-01-31 20:58:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 1957. [2022-01-31 20:58:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1957 states, 866 states have (on average 1.3949191685912241) internal successors, (1208), 979 states have internal predecessors, (1208), 1021 states have call successors, (1021), 71 states have call predecessors, (1021), 69 states have return successors, (1020), 906 states have call predecessors, (1020), 1020 states have call successors, (1020) [2022-01-31 20:58:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1957 states to 1957 states and 3249 transitions. [2022-01-31 20:58:30,303 INFO L78 Accepts]: Start accepts. Automaton has 1957 states and 3249 transitions. Word has length 146 [2022-01-31 20:58:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:30,303 INFO L470 AbstractCegarLoop]: Abstraction has 1957 states and 3249 transitions. [2022-01-31 20:58:30,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 2.0) internal successors, (44), 18 states have internal predecessors, (44), 8 states have call successors, (25), 6 states have call predecessors, (25), 4 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) [2022-01-31 20:58:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1957 states and 3249 transitions. [2022-01-31 20:58:30,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-01-31 20:58:30,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:30,309 INFO L514 BasicCegarLoop]: trace histogram [27, 26, 26, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:30,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 20:58:30,309 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:30,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:30,310 INFO L85 PathProgramCache]: Analyzing trace with hash 145311860, now seen corresponding path program 2 times [2022-01-31 20:58:30,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:30,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1939547282] [2022-01-31 20:58:30,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:30,464 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:30,464 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:30,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 20:58:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 20:58:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 20:58:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 20:58:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 20:58:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 20:58:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 20:58:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-31 20:58:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-31 20:58:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-31 20:58:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 20:58:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 20:58:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 20:58:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 20:58:30,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-01-31 20:58:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 20:58:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-01-31 20:58:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-01-31 20:58:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-01-31 20:58:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-01-31 20:58:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-01-31 20:58:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-01-31 20:58:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-01-31 20:58:30,936 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:30,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1939547282] [2022-01-31 20:58:30,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1939547282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:30,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:30,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 20:58:30,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811198729] [2022-01-31 20:58:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:30,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 20:58:30,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:30,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 20:58:30,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2022-01-31 20:58:30,937 INFO L87 Difference]: Start difference. First operand 1957 states and 3249 transitions. Second operand has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2022-01-31 20:58:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:32,628 INFO L93 Difference]: Finished difference Result 2610 states and 4327 transitions. [2022-01-31 20:58:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-01-31 20:58:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) Word has length 168 [2022-01-31 20:58:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:32,641 INFO L225 Difference]: With dead ends: 2610 [2022-01-31 20:58:32,641 INFO L226 Difference]: Without dead ends: 2608 [2022-01-31 20:58:32,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=705, Invalid=4551, Unknown=0, NotChecked=0, Total=5256 [2022-01-31 20:58:32,643 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 234 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:32,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 161 Invalid, 2438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 1744 Invalid, 0 Unknown, 267 Unchecked, 0.6s Time] [2022-01-31 20:58:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2022-01-31 20:58:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 1958. [2022-01-31 20:58:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1958 states, 872 states have (on average 1.3887614678899083) internal successors, (1211), 982 states have internal predecessors, (1211), 1012 states have call successors, (1012), 75 states have call predecessors, (1012), 73 states have return successors, (1011), 900 states have call predecessors, (1011), 1011 states have call successors, (1011) [2022-01-31 20:58:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1958 states to 1958 states and 3234 transitions. [2022-01-31 20:58:33,118 INFO L78 Accepts]: Start accepts. Automaton has 1958 states and 3234 transitions. Word has length 168 [2022-01-31 20:58:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:33,118 INFO L470 AbstractCegarLoop]: Abstraction has 1958 states and 3234 transitions. [2022-01-31 20:58:33,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 8 states have call successors, (29), 6 states have call predecessors, (29), 4 states have return successors, (27), 8 states have call predecessors, (27), 8 states have call successors, (27) [2022-01-31 20:58:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1958 states and 3234 transitions. [2022-01-31 20:58:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-01-31 20:58:33,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:33,124 INFO L514 BasicCegarLoop]: trace histogram [29, 28, 28, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:33,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 20:58:33,124 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:33,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash 587264560, now seen corresponding path program 1 times [2022-01-31 20:58:33,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:33,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630117802] [2022-01-31 20:58:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:33,325 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:33,439 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:33,440 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 20:58:33,441 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 20:58:33,441 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-01-31 20:58:33,441 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 20:58:33,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 20:58:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 20:58:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 20:58:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 20:58:33,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 20:58:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 20:58:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 20:58:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 20:58:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 20:58:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 20:58:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 20:58:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 20:58:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 20:58:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 20:58:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 20:58:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 20:58:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:33,557 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-31 20:58:34,828 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:34,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630117802] [2022-01-31 20:58:34,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1630117802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:34,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:34,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-01-31 20:58:34,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967366852] [2022-01-31 20:58:34,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:34,831 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-01-31 20:58:34,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:34,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-01-31 20:58:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2133, Unknown=0, NotChecked=0, Total=2450 [2022-01-31 20:58:34,832 INFO L87 Difference]: Start difference. First operand 1958 states and 3234 transitions. Second operand has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 34 states have internal predecessors, (63), 11 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (29), 10 states have call predecessors, (29), 11 states have call successors, (29) [2022-01-31 20:58:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:37,947 INFO L93 Difference]: Finished difference Result 3553 states and 5878 transitions. [2022-01-31 20:58:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-01-31 20:58:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 34 states have internal predecessors, (63), 11 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (29), 10 states have call predecessors, (29), 11 states have call successors, (29) Word has length 182 [2022-01-31 20:58:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:37,965 INFO L225 Difference]: With dead ends: 3553 [2022-01-31 20:58:37,965 INFO L226 Difference]: Without dead ends: 3551 [2022-01-31 20:58:37,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 7959 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2100, Invalid=16532, Unknown=0, NotChecked=0, Total=18632 [2022-01-31 20:58:37,969 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 192 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 1925 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 2687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 1925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 353 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:37,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 255 Invalid, 2687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 1925 Invalid, 0 Unknown, 353 Unchecked, 0.8s Time] [2022-01-31 20:58:37,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3551 states. [2022-01-31 20:58:38,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3551 to 3297. [2022-01-31 20:58:38,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3297 states, 1460 states have (on average 1.4006849315068493) internal successors, (2045), 1648 states have internal predecessors, (2045), 1726 states have call successors, (1726), 112 states have call predecessors, (1726), 110 states have return successors, (1725), 1536 states have call predecessors, (1725), 1725 states have call successors, (1725) [2022-01-31 20:58:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 5496 transitions. [2022-01-31 20:58:38,732 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 5496 transitions. Word has length 182 [2022-01-31 20:58:38,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:38,732 INFO L470 AbstractCegarLoop]: Abstraction has 3297 states and 5496 transitions. [2022-01-31 20:58:38,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 34 states have internal predecessors, (63), 11 states have call successors, (31), 11 states have call predecessors, (31), 9 states have return successors, (29), 10 states have call predecessors, (29), 11 states have call successors, (29) [2022-01-31 20:58:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 5496 transitions. [2022-01-31 20:58:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-31 20:58:38,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:38,742 INFO L514 BasicCegarLoop]: trace histogram [33, 32, 32, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:38,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 20:58:38,742 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:38,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:38,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1594973286, now seen corresponding path program 1 times [2022-01-31 20:58:38,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:38,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [794771877] [2022-01-31 20:58:38,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:38,984 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 1 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:39,105 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:39,106 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 20:58:39,277 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:39,278 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation UNDERAPPROXIMATION [2022-01-31 20:58:39,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 20:58:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 20:58:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 20:58:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 20:58:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 20:58:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 20:58:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-01-31 20:58:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-01-31 20:58:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-31 20:58:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 20:58:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-01-31 20:58:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-31 20:58:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-01-31 20:58:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 20:58:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 20:58:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 20:58:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-01-31 20:58:40,712 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:40,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [794771877] [2022-01-31 20:58:40,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [794771877] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:40,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:40,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-01-31 20:58:40,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704825715] [2022-01-31 20:58:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:40,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-31 20:58:40,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-31 20:58:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2900, Unknown=0, NotChecked=0, Total=3306 [2022-01-31 20:58:40,715 INFO L87 Difference]: Start difference. First operand 3297 states and 5496 transitions. Second operand has 56 states, 50 states have (on average 1.42) internal successors, (71), 39 states have internal predecessors, (71), 12 states have call successors, (35), 13 states have call predecessors, (35), 10 states have return successors, (33), 11 states have call predecessors, (33), 12 states have call successors, (33) [2022-01-31 20:58:44,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:44,868 INFO L93 Difference]: Finished difference Result 6839 states and 11325 transitions. [2022-01-31 20:58:44,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-01-31 20:58:44,868 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 50 states have (on average 1.42) internal successors, (71), 39 states have internal predecessors, (71), 12 states have call successors, (35), 13 states have call predecessors, (35), 10 states have return successors, (33), 11 states have call predecessors, (33), 12 states have call successors, (33) Word has length 204 [2022-01-31 20:58:44,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:44,876 INFO L225 Difference]: With dead ends: 6839 [2022-01-31 20:58:44,876 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:58:44,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 87 SyntacticMatches, 35 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 11078 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2604, Invalid=22518, Unknown=0, NotChecked=0, Total=25122 [2022-01-31 20:58:44,896 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 292 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 694 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 3116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 694 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 328 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:44,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 185 Invalid, 3116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [694 Valid, 2094 Invalid, 0 Unknown, 328 Unchecked, 0.9s Time] [2022-01-31 20:58:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:58:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:58:44,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 20:58:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:58:44,898 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2022-01-31 20:58:44,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:44,898 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:58:44,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 50 states have (on average 1.42) internal successors, (71), 39 states have internal predecessors, (71), 12 states have call successors, (35), 13 states have call predecessors, (35), 10 states have return successors, (33), 11 states have call predecessors, (33), 12 states have call successors, (33) [2022-01-31 20:58:44,899 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:58:44,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:58:44,900 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:58:44,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 20:58:44,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 21:09:55,681 WARN L228 SmtUtils]: Spent 11.18m on a formula simplification. DAG size of input: 562 DAG size of output: 516 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)