./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-68.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-68.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 1123f6113f06d17f462c885d49081665f821b5af861fd1db9616aecb6705c7c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:39:27,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:39:27,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:39:27,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:39:27,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:39:27,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:39:27,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:39:27,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:39:27,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:39:27,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:39:27,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:39:27,512 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:39:27,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:39:27,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:39:27,513 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:39:27,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:39:27,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:39:27,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:39:27,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:39:27,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:39:27,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:39:27,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:39:27,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:39:27,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:39:27,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:39:27,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:39:27,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:39:27,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:39:27,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:39:27,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:39:27,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:39:27,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:39:27,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:39:27,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:39:27,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:39:27,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:39:27,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:39:27,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:39:27,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:39:27,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:39:27,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:39:27,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:39:27,520 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 -> 1123f6113f06d17f462c885d49081665f821b5af861fd1db9616aecb6705c7c4 [2024-10-13 03:39:27,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:39:27,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:39:27,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:39:27,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:39:27,751 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:39:27,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i [2024-10-13 03:39:28,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:39:29,089 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:39:29,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-68.i [2024-10-13 03:39:29,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d704bccd/fe27e92ff4654df2817081c55522b2c8/FLAG454e7e4e8 [2024-10-13 03:39:29,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d704bccd/fe27e92ff4654df2817081c55522b2c8 [2024-10-13 03:39:29,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:39:29,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:39:29,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:39:29,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:39:29,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:39:29,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24f546bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29, skipping insertion in model container [2024-10-13 03:39:29,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:39:29,272 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-68.i[916,929] [2024-10-13 03:39:29,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:39:29,321 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:39:29,334 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-68.i[916,929] [2024-10-13 03:39:29,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:39:29,365 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:39:29,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29 WrapperNode [2024-10-13 03:39:29,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:39:29,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:39:29,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:39:29,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:39:29,372 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:39:29" (1/1) ... [2024-10-13 03:39:29,378 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:39:29" (1/1) ... [2024-10-13 03:39:29,398 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-13 03:39:29,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:39:29,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:39:29,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:39:29,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:39:29,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,421 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:39:29,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,422 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:39:29,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:39:29,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:39:29,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:39:29,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (1/1) ... [2024-10-13 03:39:29,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:39:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:39:29,469 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:39:29,472 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:39:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:39:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:39:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:39:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:39:29,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:39:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:39:29,590 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:39:29,592 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:39:29,808 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 03:39:29,810 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:39:29,852 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:39:29,853 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:39:29,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:39:29 BoogieIcfgContainer [2024-10-13 03:39:29,853 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:39:29,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:39:29,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:39:29,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:39:29,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:39:29" (1/3) ... [2024-10-13 03:39:29,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177f57e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:39:29, skipping insertion in model container [2024-10-13 03:39:29,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:39:29" (2/3) ... [2024-10-13 03:39:29,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@177f57e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:39:29, skipping insertion in model container [2024-10-13 03:39:29,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:39:29" (3/3) ... [2024-10-13 03:39:29,862 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-68.i [2024-10-13 03:39:29,878 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:39:29,878 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:39:29,941 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:39:29,948 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;@2d30c284, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:39:29,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:39:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:39:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:39:29,970 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:29,971 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:29,971 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:29,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash -628059000, now seen corresponding path program 1 times [2024-10-13 03:39:29,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:29,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194467436] [2024-10-13 03:39:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:29,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:39:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:39:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:39:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:39:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:39:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:39:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:39:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:39:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:39:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:39:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:39:30,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:30,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194467436] [2024-10-13 03:39:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194467436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:30,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:39:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350315324] [2024-10-13 03:39:30,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:39:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:39:30,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:39:30,363 INFO L87 Difference]: Start difference. First operand has 52 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 03:39:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:30,413 INFO L93 Difference]: Finished difference Result 101 states and 181 transitions. [2024-10-13 03:39:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:39:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 126 [2024-10-13 03:39:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:30,422 INFO L225 Difference]: With dead ends: 101 [2024-10-13 03:39:30,423 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 03:39:30,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:39:30,431 INFO L432 NwaCegarLoop]: 73 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, 73 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:39:30,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:39:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 03:39:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-13 03:39:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:39:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 76 transitions. [2024-10-13 03:39:30,479 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 76 transitions. Word has length 126 [2024-10-13 03:39:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:30,480 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 76 transitions. [2024-10-13 03:39:30,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-13 03:39:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 76 transitions. [2024-10-13 03:39:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:39:30,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:30,483 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:30,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:39:30,484 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1550893754, now seen corresponding path program 1 times [2024-10-13 03:39:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825781242] [2024-10-13 03:39:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:39:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:39:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:39:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:39:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:39:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:39:37,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:39:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:39:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:39:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:39:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:39:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:39:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:39:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:39:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:39:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:39:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:39:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:39:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:39:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:39:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:39:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:39:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:39:37,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:39:37,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825781242] [2024-10-13 03:39:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825781242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:39:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:39:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 03:39:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058936178] [2024-10-13 03:39:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:39:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 03:39:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:39:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 03:39:37,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:39:37,961 INFO L87 Difference]: Start difference. First operand 50 states and 76 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:39:38,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:39:38,171 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2024-10-13 03:39:38,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:39:38,172 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 126 [2024-10-13 03:39:38,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:39:38,173 INFO L225 Difference]: With dead ends: 74 [2024-10-13 03:39:38,174 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 03:39:38,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:39:38,175 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 33 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 03:39:38,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 211 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 03:39:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 03:39:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 57. [2024-10-13 03:39:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:39:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2024-10-13 03:39:38,190 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 126 [2024-10-13 03:39:38,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:39:38,192 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2024-10-13 03:39:38,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:39:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2024-10-13 03:39:38,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:39:38,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:39:38,196 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:39:38,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:39:38,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:39:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1550834172, now seen corresponding path program 1 times [2024-10-13 03:39:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:39:38,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798529605] [2024-10-13 03:39:38,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:39:38,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:39:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:40:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:40:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:40:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:40:32,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:40:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:40:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:40:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:40:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:40:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798529605] [2024-10-13 03:40:32,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798529605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:32,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:32,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 03:40:32,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312451653] [2024-10-13 03:40:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:32,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 03:40:32,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:32,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 03:40:32,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 03:40:32,080 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:35,901 INFO L93 Difference]: Finished difference Result 80 states and 113 transitions. [2024-10-13 03:40:35,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 03:40:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 126 [2024-10-13 03:40:35,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:35,904 INFO L225 Difference]: With dead ends: 80 [2024-10-13 03:40:35,904 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 03:40:35,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-13 03:40:35,905 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 34 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:35,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 248 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 03:40:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 03:40:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 60. [2024-10-13 03:40:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 03:40:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2024-10-13 03:40:35,921 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 126 [2024-10-13 03:40:35,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:35,922 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2024-10-13 03:40:35,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2024-10-13 03:40:35,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:40:35,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:35,924 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:35,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:40:35,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:35,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1543267258, now seen corresponding path program 1 times [2024-10-13 03:40:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:35,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615911952] [2024-10-13 03:40:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:40:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:40:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:40:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:40:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:40:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:40:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:40:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:40:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:40:36,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:36,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615911952] [2024-10-13 03:40:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615911952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:36,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296044422] [2024-10-13 03:40:36,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:36,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:36,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:36,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:36,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:36,018 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:36,043 INFO L93 Difference]: Finished difference Result 140 states and 209 transitions. [2024-10-13 03:40:36,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:36,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 126 [2024-10-13 03:40:36,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:36,046 INFO L225 Difference]: With dead ends: 140 [2024-10-13 03:40:36,046 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 03:40:36,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:40:36,047 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:36,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 03:40:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2024-10-13 03:40:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:40:36,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-13 03:40:36,058 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 126 [2024-10-13 03:40:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:36,058 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-13 03:40:36,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-13 03:40:36,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:40:36,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:36,064 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:40:36,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:36,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:36,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1543207676, now seen corresponding path program 1 times [2024-10-13 03:40:36,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:36,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451603992] [2024-10-13 03:40:36,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:36,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:42,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:40:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:40:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:40:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:40:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:40:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:40:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:40:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:40:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:40:42,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451603992] [2024-10-13 03:40:42,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451603992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:42,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:42,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:40:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819736935] [2024-10-13 03:40:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:40:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:42,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:40:42,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:40:42,447 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:42,920 INFO L93 Difference]: Finished difference Result 106 states and 150 transitions. [2024-10-13 03:40:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 03:40:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 126 [2024-10-13 03:40:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:42,923 INFO L225 Difference]: With dead ends: 106 [2024-10-13 03:40:42,924 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 03:40:42,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:40:42,925 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 55 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:40:42,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 234 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:40:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 03:40:42,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2024-10-13 03:40:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:40:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2024-10-13 03:40:42,938 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 126 [2024-10-13 03:40:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:42,938 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2024-10-13 03:40:42,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:42,939 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2024-10-13 03:40:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-13 03:40:42,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:42,940 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:42,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:40:42,941 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:42,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:42,942 INFO L85 PathProgramCache]: Analyzing trace with hash 969125762, now seen corresponding path program 1 times [2024-10-13 03:40:42,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:42,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872483145] [2024-10-13 03:40:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:42,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:42,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:42,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:40:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:40:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:40:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:40:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:40:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:40:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 03:40:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:40:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-13 03:40:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:40:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 03:40:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:40:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:40:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:40:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:40:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:40:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:40:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:40:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:40:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:40:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:40:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:40:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-13 03:40:43,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:40:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872483145] [2024-10-13 03:40:43,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872483145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:40:43,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:40:43,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 03:40:43,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705112299] [2024-10-13 03:40:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:40:43,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 03:40:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:40:43,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 03:40:43,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 03:40:43,047 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:43,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:40:43,069 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2024-10-13 03:40:43,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 03:40:43,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 126 [2024-10-13 03:40:43,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:40:43,073 INFO L225 Difference]: With dead ends: 152 [2024-10-13 03:40:43,073 INFO L226 Difference]: Without dead ends: 75 [2024-10-13 03:40:43,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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:40:43,074 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 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:40:43,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:40:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-13 03:40:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-10-13 03:40:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 45 states have internal predecessors, (53), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 03:40:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-10-13 03:40:43,094 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 126 [2024-10-13 03:40:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:40:43,094 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-10-13 03:40:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-13 03:40:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-10-13 03:40:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 03:40:43,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:40:43,096 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 03:40:43,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:40:43,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:40:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1483985703, now seen corresponding path program 1 times [2024-10-13 03:40:43,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:40:43,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143953789] [2024-10-13 03:40:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:40:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:40:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat