./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.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 acffbf4568185b4df73fbdfca312807b0d1acfe4982bda3fcfc32319476145af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:12:50,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:12:50,517 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:12:50,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:12:50,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:12:50,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:12:50,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:12:50,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:12:50,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:12:50,561 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:12:50,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:12:50,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:12:50,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:12:50,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:12:50,564 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:12:50,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:12:50,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:12:50,565 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:12:50,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:12:50,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:12:50,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:12:50,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:12:50,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:12:50,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:12:50,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:12:50,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:12:50,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:12:50,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:12:50,572 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:12:50,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:12:50,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:12:50,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:12:50,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:12:50,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:12:50,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:12:50,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:12:50,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:12:50,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:12:50,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:12:50,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:12:50,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:12:50,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:12:50,578 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 -> acffbf4568185b4df73fbdfca312807b0d1acfe4982bda3fcfc32319476145af [2024-11-10 05:12:50,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:12:50,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:12:50,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:12:50,882 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:12:50,882 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:12:50,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2024-11-10 05:12:52,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:12:52,704 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:12:52,705 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2024-11-10 05:12:52,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e6a8268/6ec56f6cd0d8415db2a55256dc6762ea/FLAG304755b2f [2024-11-10 05:12:52,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e6a8268/6ec56f6cd0d8415db2a55256dc6762ea [2024-11-10 05:12:52,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:12:52,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:12:52,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:12:52,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:12:52,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:12:52,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:12:52" (1/1) ... [2024-11-10 05:12:52,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@622b9113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:52, skipping insertion in model container [2024-11-10 05:12:52,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:12:52" (1/1) ... [2024-11-10 05:12:52,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:12:52,967 WARN L250 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_fillercode_fillercodestructure_filler-pe-co_file-10.i[919,932] [2024-11-10 05:12:53,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:12:53,180 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:12:53,195 WARN L250 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_fillercode_fillercodestructure_filler-pe-co_file-10.i[919,932] [2024-11-10 05:12:53,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:12:53,256 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:12:53,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53 WrapperNode [2024-11-10 05:12:53,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:12:53,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:12:53,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:12:53,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:12:53,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,334 INFO L138 Inliner]: procedures = 26, calls = 55, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 317 [2024-11-10 05:12:53,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:12:53,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:12:53,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:12:53,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:12:53,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,358 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,380 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-11-10 05:12:53,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,396 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,406 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,419 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:12:53,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:12:53,420 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:12:53,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:12:53,421 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (1/1) ... [2024-11-10 05:12:53,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:12:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:12:53,459 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-11-10 05:12:53,462 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-11-10 05:12:53,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:12:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:12:53,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:12:53,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:12:53,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:12:53,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:12:53,634 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:12:53,636 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:12:54,153 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L211: havoc property_#t~bitwise35#1;havoc property_#t~ite37#1;havoc property_#t~bitwise36#1;havoc property_#t~short38#1; [2024-11-10 05:12:54,255 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-10 05:12:54,255 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:12:54,299 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:12:54,299 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:12:54,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:12:54 BoogieIcfgContainer [2024-11-10 05:12:54,300 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:12:54,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:12:54,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:12:54,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:12:54,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:12:52" (1/3) ... [2024-11-10 05:12:54,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7db91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:12:54, skipping insertion in model container [2024-11-10 05:12:54,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:12:53" (2/3) ... [2024-11-10 05:12:54,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7db91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:12:54, skipping insertion in model container [2024-11-10 05:12:54,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:12:54" (3/3) ... [2024-11-10 05:12:54,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-10.i [2024-11-10 05:12:54,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:12:54,332 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:12:54,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:12:54,412 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;@754c59a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:12:54,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:12:54,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 97 states have internal predecessors, (136), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 05:12:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-10 05:12:54,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:12:54,436 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:12:54,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:12:54,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:12:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash 896884900, now seen corresponding path program 1 times [2024-11-10 05:12:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:12:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262440053] [2024-11-10 05:12:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:12:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:12:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:12:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:12:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:12:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:12:54,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:12:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:12:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:12:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:12:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:12:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:12:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:12:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:12:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:12:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:12:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:12:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:12:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:12:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:12:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:12:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:12:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:12:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:12:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:12:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:12:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:12:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:12:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:12:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:12:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 05:12:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:12:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 05:12:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:12:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 05:12:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:12:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-10 05:12:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 05:12:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 05:12:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 05:12:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-10 05:12:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 05:12:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 05:12:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 05:12:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-10 05:12:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:12:55,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262440053] [2024-11-10 05:12:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262440053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:12:55,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:12:55,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:12:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405604696] [2024-11-10 05:12:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:12:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:12:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:12:55,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:12:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:12:55,211 INFO L87 Difference]: Start difference. First operand has 141 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 97 states have internal predecessors, (136), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:12:55,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:12:55,269 INFO L93 Difference]: Finished difference Result 274 states and 475 transitions. [2024-11-10 05:12:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:12:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) Word has length 264 [2024-11-10 05:12:55,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:12:55,292 INFO L225 Difference]: With dead ends: 274 [2024-11-10 05:12:55,292 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 05:12:55,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-11-10 05:12:55,301 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:12:55,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:12:55,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 05:12:55,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 05:12:55,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 92 states have (on average 1.391304347826087) internal successors, (128), 92 states have internal predecessors, (128), 42 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 05:12:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 212 transitions. [2024-11-10 05:12:55,364 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 212 transitions. Word has length 264 [2024-11-10 05:12:55,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:12:55,365 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 212 transitions. [2024-11-10 05:12:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:12:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 212 transitions. [2024-11-10 05:12:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-10 05:12:55,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:12:55,376 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:12:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:12:55,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:12:55,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:12:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -244319032, now seen corresponding path program 1 times [2024-11-10 05:12:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:12:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352395983] [2024-11-10 05:12:55,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:12:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:12:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:12:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:12:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:12:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:12:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:12:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:12:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:12:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:12:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:12:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:12:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:12:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:12:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:12:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:12:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:12:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:12:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:12:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:12:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:12:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:12:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:12:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:12:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:12:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:12:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:12:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:12:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:12:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:12:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 05:12:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:12:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 05:12:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:12:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 05:12:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:12:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-10 05:12:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 05:12:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 05:12:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 05:12:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-10 05:12:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 05:12:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 05:12:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 05:12:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:12:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-10 05:12:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:12:56,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352395983] [2024-11-10 05:12:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352395983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:12:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:12:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:12:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346554315] [2024-11-10 05:12:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:12:56,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:12:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:12:56,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:12:56,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:12:56,404 INFO L87 Difference]: Start difference. First operand 136 states and 212 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-10 05:12:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:12:56,802 INFO L93 Difference]: Finished difference Result 404 states and 632 transitions. [2024-11-10 05:12:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:12:56,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) Word has length 264 [2024-11-10 05:12:56,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:12:56,810 INFO L225 Difference]: With dead ends: 404 [2024-11-10 05:12:56,812 INFO L226 Difference]: Without dead ends: 271 [2024-11-10 05:12:56,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:12:56,815 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 133 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:12:56,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 583 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:12:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-10 05:12:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 209. [2024-11-10 05:12:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 122 states have internal predecessors, (158), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 05:12:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 326 transitions. [2024-11-10 05:12:56,874 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 326 transitions. Word has length 264 [2024-11-10 05:12:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:12:56,875 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 326 transitions. [2024-11-10 05:12:56,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 1 states have call predecessors, (42), 1 states have call successors, (42) [2024-11-10 05:12:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 326 transitions. [2024-11-10 05:12:56,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-10 05:12:56,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:12:56,881 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:12:56,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:12:56,882 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:12:56,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:12:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1843583916, now seen corresponding path program 1 times [2024-11-10 05:12:56,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:12:56,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531049931] [2024-11-10 05:12:56,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:12:56,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:12:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:13:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:13:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:13:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:13:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:13:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:13:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:13:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:13:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:13:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:13:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:13:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:13:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:13:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:13:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:13:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:13:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:13:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:13:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:13:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:13:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:13:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:13:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:13:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:13:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:13:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:13:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:13:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:13:20,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 05:13:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:13:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 05:13:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:13:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 05:13:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:13:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-10 05:13:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 05:13:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 05:13:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 05:13:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-10 05:13:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 05:13:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 05:13:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 05:13:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:13:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-10 05:13:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:13:20,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531049931] [2024-11-10 05:13:20,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531049931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:13:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:13:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 05:13:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25576585] [2024-11-10 05:13:20,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:13:20,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 05:13:20,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:13:20,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 05:13:20,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:13:20,435 INFO L87 Difference]: Start difference. First operand 209 states and 326 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:13:23,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:13:23,373 INFO L93 Difference]: Finished difference Result 698 states and 1073 transitions. [2024-11-10 05:13:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 05:13:23,374 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 265 [2024-11-10 05:13:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:13:23,383 INFO L225 Difference]: With dead ends: 698 [2024-11-10 05:13:23,383 INFO L226 Difference]: Without dead ends: 565 [2024-11-10 05:13:23,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2024-11-10 05:13:23,386 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 1146 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:13:23,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1348 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 05:13:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2024-11-10 05:13:23,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 392. [2024-11-10 05:13:23,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 260 states have internal predecessors, (350), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-10 05:13:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 602 transitions. [2024-11-10 05:13:23,469 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 602 transitions. Word has length 265 [2024-11-10 05:13:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:13:23,471 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 602 transitions. [2024-11-10 05:13:23,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-10 05:13:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 602 transitions. [2024-11-10 05:13:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-10 05:13:23,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:13:23,479 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:13:23,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:13:23,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:13:23,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:13:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1606911509, now seen corresponding path program 1 times [2024-11-10 05:13:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:13:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265228016] [2024-11-10 05:13:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:13:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:13:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:14:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:14:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:14:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:14:11,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:14:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:14:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:14:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:14:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:14:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:14:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:14:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:14:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:14:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:14:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 05:14:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:14:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:14:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:14:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:14:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 05:14:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:14:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:14:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:14:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:14:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 05:14:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 05:14:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 05:14:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 05:14:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-10 05:14:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 05:14:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 05:14:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-10 05:14:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-10 05:14:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-10 05:14:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-10 05:14:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-10 05:14:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-11-10 05:14:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-10 05:14:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-10 05:14:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-10 05:14:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-10 05:14:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-10 05:14:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:14:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3444 trivial. 0 not checked. [2024-11-10 05:14:11,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:14:11,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265228016] [2024-11-10 05:14:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265228016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:14:11,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:14:11,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 05:14:11,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701007927] [2024-11-10 05:14:11,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:14:11,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 05:14:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:14:11,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 05:14:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:14:11,824 INFO L87 Difference]: Start difference. First operand 392 states and 602 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2024-11-10 05:14:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:14:15,284 INFO L93 Difference]: Finished difference Result 843 states and 1263 transitions. [2024-11-10 05:14:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 05:14:15,284 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) Word has length 265 [2024-11-10 05:14:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:14:15,290 INFO L225 Difference]: With dead ends: 843 [2024-11-10 05:14:15,290 INFO L226 Difference]: Without dead ends: 710 [2024-11-10 05:14:15,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=270, Invalid=786, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 05:14:15,297 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1684 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:14:15,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 1496 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 05:14:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-10 05:14:15,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 316. [2024-11-10 05:14:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 227 states have internal predecessors, (318), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 05:14:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 486 transitions. [2024-11-10 05:14:15,338 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 486 transitions. Word has length 265 [2024-11-10 05:14:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:14:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 486 transitions. [2024-11-10 05:14:15,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 3 states have call successors, (42), 1 states have call predecessors, (42), 1 states have return successors, (42), 3 states have call predecessors, (42), 3 states have call successors, (42) [2024-11-10 05:14:15,340 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 486 transitions. [2024-11-10 05:14:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-10 05:14:15,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:14:15,343 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 05:14:15,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:14:15,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:14:15,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:14:15,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1939152852, now seen corresponding path program 1 times [2024-11-10 05:14:15,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:14:15,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680362445] [2024-11-10 05:14:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:14:15,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:14:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat