./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b01fbd155c23efe3aacc2859ba2e72ec35bc54609af42a0cd81c3883d9fe03f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:33:55,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:33:55,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:33:55,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:33:55,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:33:55,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:33:55,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:33:55,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:33:55,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:33:55,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:33:55,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:33:55,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:33:55,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:33:56,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:33:56,001 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:33:56,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:33:56,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:33:56,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:33:56,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:33:56,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:33:56,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:33:56,007 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:33:56,007 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:33:56,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:33:56,008 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:33:56,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:33:56,009 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:33:56,009 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:33:56,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:33:56,010 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:33:56,010 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:33:56,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:33:56,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:56,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:33:56,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:33:56,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:33:56,011 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:33:56,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:33:56,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:33:56,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:33:56,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:33:56,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:33:56,014 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b01fbd155c23efe3aacc2859ba2e72ec35bc54609af42a0cd81c3883d9fe03f [2024-10-13 03:33:56,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:33:56,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:33:56,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:33:56,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:33:56,306 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:33:56,307 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i [2024-10-13 03:33:57,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:33:57,997 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:33:57,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i [2024-10-13 03:33:58,007 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a04ecb/ff6d7f73ac0e47c1ab93bf628bec972c/FLAG260ca3d13 [2024-10-13 03:33:58,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a04ecb/ff6d7f73ac0e47c1ab93bf628bec972c [2024-10-13 03:33:58,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:33:58,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:33:58,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:58,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:33:58,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:33:58,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47c9c7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58, skipping insertion in model container [2024-10-13 03:33:58,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:33:58,579 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i[916,929] [2024-10-13 03:33:58,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:58,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:33:58,636 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-15.i[916,929] [2024-10-13 03:33:58,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:33:58,682 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:33:58,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58 WrapperNode [2024-10-13 03:33:58,683 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:33:58,684 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:58,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:33:58,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:33:58,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,737 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 109 [2024-10-13 03:33:58,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:33:58,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:33:58,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:33:58,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:33:58,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,774 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:33:58,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,794 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:33:58,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:33:58,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:33:58,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:33:58,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (1/1) ... [2024-10-13 03:33:58,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:33:58,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:33:58,834 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:33:58,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:33:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:33:58,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:33:58,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:33:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:33:58,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:33:58,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:33:58,940 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:33:58,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:33:59,162 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 03:33:59,162 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:33:59,213 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:33:59,213 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:33:59,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:59 BoogieIcfgContainer [2024-10-13 03:33:59,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:33:59,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:33:59,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:33:59,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:33:59,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:33:58" (1/3) ... [2024-10-13 03:33:59,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c09a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:59, skipping insertion in model container [2024-10-13 03:33:59,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:33:58" (2/3) ... [2024-10-13 03:33:59,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c09a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:33:59, skipping insertion in model container [2024-10-13 03:33:59,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:33:59" (3/3) ... [2024-10-13 03:33:59,225 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-15.i [2024-10-13 03:33:59,244 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:33:59,245 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:33:59,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:33:59,303 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4c5b604c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:33:59,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:33:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:33:59,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:33:59,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:59,320 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:33:59,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:59,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1355226166, now seen corresponding path program 1 times [2024-10-13 03:33:59,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:33:59,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894806916] [2024-10-13 03:33:59,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:59,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:33:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:33:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:33:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:33:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:33:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:33:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:33:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:33:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:33:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:33:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:33:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:33:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:33:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:33:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:33:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:33:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:33:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:33:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:33:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:33:59,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894806916] [2024-10-13 03:33:59,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894806916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:33:59,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:33:59,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:33:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825105770] [2024-10-13 03:33:59,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:33:59,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:33:59,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:33:59,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:33:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:33:59,748 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:33:59,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:33:59,804 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2024-10-13 03:33:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:33:59,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 98 [2024-10-13 03:33:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:33:59,815 INFO L225 Difference]: With dead ends: 85 [2024-10-13 03:33:59,815 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 03:33:59,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:33:59,823 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:33:59,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:33:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 03:33:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 03:33:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:33:59,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-13 03:33:59,866 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 98 [2024-10-13 03:33:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:33:59,868 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-13 03:33:59,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 03:33:59,869 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-13 03:33:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:33:59,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:33:59,875 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:33:59,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:33:59,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:33:59,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:33:59,877 INFO L85 PathProgramCache]: Analyzing trace with hash 549848010, now seen corresponding path program 1 times [2024-10-13 03:33:59,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:33:59,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947209420] [2024-10-13 03:33:59,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:33:59,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:33:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:00,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:00,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947209420] [2024-10-13 03:34:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947209420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:00,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 03:34:00,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036573070] [2024-10-13 03:34:00,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:00,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 03:34:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 03:34:00,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:34:00,465 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:00,519 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2024-10-13 03:34:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 03:34:00,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 03:34:00,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:00,523 INFO L225 Difference]: With dead ends: 95 [2024-10-13 03:34:00,524 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 03:34:00,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 03:34:00,527 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:00,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 123 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:34:00,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 03:34:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2024-10-13 03:34:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 03:34:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2024-10-13 03:34:00,539 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 98 [2024-10-13 03:34:00,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:00,542 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2024-10-13 03:34:00,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:00,542 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2024-10-13 03:34:00,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-13 03:34:00,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:00,548 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:00,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:34:00,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:00,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:00,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1515508746, now seen corresponding path program 1 times [2024-10-13 03:34:00,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:00,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87239773] [2024-10-13 03:34:00,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:00,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87239773] [2024-10-13 03:34:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87239773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:00,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:00,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:34:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710807897] [2024-10-13 03:34:00,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:00,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:34:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:34:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:34:00,795 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:00,837 INFO L93 Difference]: Finished difference Result 131 states and 191 transitions. [2024-10-13 03:34:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:34:00,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 98 [2024-10-13 03:34:00,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:00,839 INFO L225 Difference]: With dead ends: 131 [2024-10-13 03:34:00,840 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 03:34:00,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:34:00,843 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:00,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 123 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:34:00,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 03:34:00,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-13 03:34:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:34:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-10-13 03:34:00,870 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 98 [2024-10-13 03:34:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-10-13 03:34:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-10-13 03:34:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:34:00,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:00,872 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:00,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:34:00,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -543822701, now seen corresponding path program 1 times [2024-10-13 03:34:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959902765] [2024-10-13 03:34:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:00,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:04,607 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:04,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959902765] [2024-10-13 03:34:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959902765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:34:04,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391480473] [2024-10-13 03:34:04,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:04,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:34:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:04,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:34:04,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:34:04,613 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:04,951 INFO L93 Difference]: Finished difference Result 102 states and 144 transitions. [2024-10-13 03:34:04,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:34:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 03:34:04,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:04,953 INFO L225 Difference]: With dead ends: 102 [2024-10-13 03:34:04,954 INFO L226 Difference]: Without dead ends: 100 [2024-10-13 03:34:04,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:34:04,955 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:04,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 206 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:34:04,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-13 03:34:04,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2024-10-13 03:34:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:34:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2024-10-13 03:34:04,973 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 99 [2024-10-13 03:34:04,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:04,973 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2024-10-13 03:34:04,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2024-10-13 03:34:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:34:04,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:04,975 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:04,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:34:04,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:04,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash 136235669, now seen corresponding path program 1 times [2024-10-13 03:34:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:04,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524925231] [2024-10-13 03:34:04,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:04,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:05,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:05,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524925231] [2024-10-13 03:34:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524925231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:05,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:34:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286245023] [2024-10-13 03:34:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:34:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:34:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:34:05,077 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:05,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:05,103 INFO L93 Difference]: Finished difference Result 147 states and 210 transitions. [2024-10-13 03:34:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:34:05,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 03:34:05,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:05,106 INFO L225 Difference]: With dead ends: 147 [2024-10-13 03:34:05,106 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 03:34:05,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:34:05,107 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:05,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:34:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 03:34:05,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2024-10-13 03:34:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:34:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2024-10-13 03:34:05,120 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 99 [2024-10-13 03:34:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:05,121 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2024-10-13 03:34:05,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2024-10-13 03:34:05,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-13 03:34:05,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:05,123 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:05,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:34:05,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:05,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash -673110957, now seen corresponding path program 1 times [2024-10-13 03:34:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444029162] [2024-10-13 03:34:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:06,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:06,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444029162] [2024-10-13 03:34:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444029162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:34:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531970314] [2024-10-13 03:34:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:06,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:34:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:34:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:34:06,754 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:07,249 INFO L93 Difference]: Finished difference Result 99 states and 137 transitions. [2024-10-13 03:34:07,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:34:07,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-13 03:34:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:07,251 INFO L225 Difference]: With dead ends: 99 [2024-10-13 03:34:07,251 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 03:34:07,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:34:07,253 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 42 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:07,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 235 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 03:34:07,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 03:34:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2024-10-13 03:34:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 03:34:07,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-13 03:34:07,270 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 99 [2024-10-13 03:34:07,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:07,270 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-13 03:34:07,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:07,271 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-13 03:34:07,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 03:34:07,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:07,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:07,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:34:07,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:07,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash 81127969, now seen corresponding path program 1 times [2024-10-13 03:34:07,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:07,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692229573] [2024-10-13 03:34:07,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:07,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692229573] [2024-10-13 03:34:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692229573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:15,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:15,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:34:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119363274] [2024-10-13 03:34:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:34:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:34:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:34:15,535 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:34:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:17,457 INFO L93 Difference]: Finished difference Result 127 states and 170 transitions. [2024-10-13 03:34:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 03:34:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2024-10-13 03:34:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:17,459 INFO L225 Difference]: With dead ends: 127 [2024-10-13 03:34:17,459 INFO L226 Difference]: Without dead ends: 125 [2024-10-13 03:34:17,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2024-10-13 03:34:17,460 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:17,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 423 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 03:34:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-13 03:34:17,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2024-10-13 03:34:17,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.178082191780822) internal successors, (86), 74 states have internal predecessors, (86), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:34:17,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 158 transitions. [2024-10-13 03:34:17,486 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 158 transitions. Word has length 100 [2024-10-13 03:34:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:17,487 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 158 transitions. [2024-10-13 03:34:17,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:34:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 158 transitions. [2024-10-13 03:34:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 03:34:17,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:17,489 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:17,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 03:34:17,490 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:17,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash 79280927, now seen corresponding path program 1 times [2024-10-13 03:34:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:17,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764922256] [2024-10-13 03:34:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:17,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:21,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:21,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:21,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764922256] [2024-10-13 03:34:21,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764922256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:21,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:21,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 03:34:21,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230552879] [2024-10-13 03:34:21,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:21,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 03:34:21,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:21,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 03:34:21,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:34:21,520 INFO L87 Difference]: Start difference. First operand 113 states and 158 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:34:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:23,201 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2024-10-13 03:34:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 03:34:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 100 [2024-10-13 03:34:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:23,202 INFO L225 Difference]: With dead ends: 125 [2024-10-13 03:34:23,203 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 03:34:23,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2024-10-13 03:34:23,204 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 164 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:23,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 370 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:34:23,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 03:34:23,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2024-10-13 03:34:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:34:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-10-13 03:34:23,233 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 100 [2024-10-13 03:34:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:23,234 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-10-13 03:34:23,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 03:34:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2024-10-13 03:34:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 03:34:23,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:23,235 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:23,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 03:34:23,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 368159329, now seen corresponding path program 1 times [2024-10-13 03:34:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003302436] [2024-10-13 03:34:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:24,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:24,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003302436] [2024-10-13 03:34:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003302436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:34:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741510083] [2024-10-13 03:34:24,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:24,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:34:24,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:34:24,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:34:24,599 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:25,008 INFO L93 Difference]: Finished difference Result 122 states and 165 transitions. [2024-10-13 03:34:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:34:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-13 03:34:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:25,011 INFO L225 Difference]: With dead ends: 122 [2024-10-13 03:34:25,011 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 03:34:25,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:34:25,013 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 58 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:25,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 202 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:34:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 03:34:25,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2024-10-13 03:34:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 71 states have internal predecessors, (82), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:34:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2024-10-13 03:34:25,027 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 100 [2024-10-13 03:34:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:25,027 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2024-10-13 03:34:25,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2024-10-13 03:34:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-13 03:34:25,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:25,028 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 03:34:25,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 03:34:25,029 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:25,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:25,029 INFO L85 PathProgramCache]: Analyzing trace with hash 366312287, now seen corresponding path program 1 times [2024-10-13 03:34:25,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:25,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628269932] [2024-10-13 03:34:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:25,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 03:34:25,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:25,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628269932] [2024-10-13 03:34:25,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628269932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:25,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:25,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 03:34:25,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671857234] [2024-10-13 03:34:25,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:25,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 03:34:25,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:25,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 03:34:25,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 03:34:25,951 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:26,293 INFO L93 Difference]: Finished difference Result 118 states and 161 transitions. [2024-10-13 03:34:26,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 03:34:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-13 03:34:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:26,295 INFO L225 Difference]: With dead ends: 118 [2024-10-13 03:34:26,295 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 03:34:26,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:34:26,296 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 36 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:26,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 232 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:34:26,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 03:34:26,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2024-10-13 03:34:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:34:26,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-10-13 03:34:26,309 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 100 [2024-10-13 03:34:26,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-10-13 03:34:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:26,310 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-10-13 03:34:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 03:34:26,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:26,312 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 03:34:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 03:34:26,312 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1088490459, now seen corresponding path program 1 times [2024-10-13 03:34:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107121647] [2024-10-13 03:34:26,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:26,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:27,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:34:27,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:34:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:34:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 03:34:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:34:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 03:34:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:34:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-13 03:34:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:34:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 03:34:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-13 03:34:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 03:34:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 03:34:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 03:34:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 03:34:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 03:34:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2010 trivial. 0 not checked. [2024-10-13 03:34:27,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:27,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107121647] [2024-10-13 03:34:27,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107121647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:34:27,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:34:27,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:34:27,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965872260] [2024-10-13 03:34:27,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:34:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:34:27,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:34:27,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:34:27,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:34:27,320 INFO L87 Difference]: Start difference. First operand 107 states and 150 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:34:27,445 INFO L93 Difference]: Finished difference Result 123 states and 167 transitions. [2024-10-13 03:34:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:34:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 196 [2024-10-13 03:34:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:34:27,447 INFO L225 Difference]: With dead ends: 123 [2024-10-13 03:34:27,447 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 03:34:27,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:34:27,448 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 17 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:34:27,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 215 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:34:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 03:34:27,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2024-10-13 03:34:27,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 03:34:27,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-10-13 03:34:27,473 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 196 [2024-10-13 03:34:27,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:34:27,474 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-10-13 03:34:27,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 03:34:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-10-13 03:34:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 03:34:27,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:34:27,476 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 03:34:27,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 03:34:27,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:34:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:34:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 207292312, now seen corresponding path program 1 times [2024-10-13 03:34:27,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:34:27,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482824694] [2024-10-13 03:34:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:27,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:34:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:34:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:34:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:34:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:34:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:34:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:34:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:34:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:34:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:34:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:34:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:34:28,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:34:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 03:34:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:34:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 03:34:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:34:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:34:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-13 03:34:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:34:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-13 03:34:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:34:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-13 03:34:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:34:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-13 03:34:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:34:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 03:34:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-13 03:34:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 03:34:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-13 03:34:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-10-13 03:34:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-13 03:34:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-10-13 03:34:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-13 03:34:28,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:34:28,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482824694] [2024-10-13 03:34:28,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482824694] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 03:34:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094101840] [2024-10-13 03:34:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:34:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 03:34:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:34:28,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 03:34:28,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 03:34:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:34:28,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 03:34:28,947 INFO L278 TraceCheckSpWp]: Computing forward predicates...