./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-magicseries1.c --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/floats-nonlinear/color-magicseries1.c -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 36e10b539b0c5593d108c5ae8d5aca590fa779f1bae4b76f536932feddfdfc87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:57:25,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:57:25,378 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:57:25,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:57:25,384 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:57:25,404 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:57:25,404 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:57:25,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:57:25,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:57:25,408 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:57:25,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:57:25,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:57:25,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:57:25,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:57:25,410 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:57:25,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:57:25,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:57:25,411 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:57:25,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:57:25,411 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:57:25,411 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:57:25,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:57:25,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:57:25,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:57:25,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:57:25,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:57:25,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:57:25,413 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:57:25,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:57:25,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:57:25,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:57:25,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:57:25,415 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:57:25,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:57:25,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:57:25,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:57:25,416 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 -> 36e10b539b0c5593d108c5ae8d5aca590fa779f1bae4b76f536932feddfdfc87 [2024-11-09 21:57:25,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:57:25,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:57:25,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:57:25,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:57:25,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:57:25,666 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2024-11-09 21:57:26,973 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:57:27,101 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:57:27,101 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2024-11-09 21:57:27,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2a1a39f/e14aca79402b4fa99f4d009313a85b99/FLAG9678f37fc [2024-11-09 21:57:27,522 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f2a1a39f/e14aca79402b4fa99f4d009313a85b99 [2024-11-09 21:57:27,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:57:27,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:57:27,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:57:27,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:57:27,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:57:27,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0fade7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27, skipping insertion in model container [2024-11-09 21:57:27,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:57:27,685 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/floats-nonlinear/color-magicseries1.c[613,626] [2024-11-09 21:57:27,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:57:27,718 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:57:27,726 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/floats-nonlinear/color-magicseries1.c[613,626] [2024-11-09 21:57:27,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:57:27,753 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:57:27,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27 WrapperNode [2024-11-09 21:57:27,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:57:27,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:57:27,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:57:27,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:57:27,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,788 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-11-09 21:57:27,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:57:27,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:57:27,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:57:27,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:57:27,799 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,816 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-09 21:57:27,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,822 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:57:27,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:57:27,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:57:27,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:57:27,832 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (1/1) ... [2024-11-09 21:57:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:57:27,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:27,861 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-09 21:57:27,864 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-09 21:57:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:57:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:57:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:57:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 21:57:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-09 21:57:27,903 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-09 21:57:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:57:27,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:57:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 21:57:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 21:57:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:57:27,969 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:57:27,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:57:28,181 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L33: call ULTIMATE.dealloc(check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset);havoc check_sum_~#s~0#1.base, check_sum_~#s~0#1.offset; [2024-11-09 21:57:28,201 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-09 21:57:28,202 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:57:28,213 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:57:28,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:57:28,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:57:28 BoogieIcfgContainer [2024-11-09 21:57:28,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:57:28,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:57:28,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:57:28,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:57:28,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:57:27" (1/3) ... [2024-11-09 21:57:28,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4a8545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:28, skipping insertion in model container [2024-11-09 21:57:28,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:57:27" (2/3) ... [2024-11-09 21:57:28,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f4a8545 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:57:28, skipping insertion in model container [2024-11-09 21:57:28,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:57:28" (3/3) ... [2024-11-09 21:57:28,222 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries1.c [2024-11-09 21:57:28,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:57:28,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 21:57:28,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:57:28,295 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;@71211b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:57:28,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 21:57:28,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 21:57:28,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:28,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:28,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:28,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:28,310 INFO L85 PathProgramCache]: Analyzing trace with hash 859825251, now seen corresponding path program 1 times [2024-11-09 21:57:28,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:28,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600368012] [2024-11-09 21:57:28,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:28,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:28,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:28,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600368012] [2024-11-09 21:57:28,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600368012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:28,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:28,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:57:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809749961] [2024-11-09 21:57:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:28,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 21:57:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:28,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 21:57:28,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:57:28,614 INFO L87 Difference]: Start difference. First operand has 41 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:28,667 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2024-11-09 21:57:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 21:57:28,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 21:57:28,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:28,674 INFO L225 Difference]: With dead ends: 78 [2024-11-09 21:57:28,674 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 21:57:28,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 21:57:28,680 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:28,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:28,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 21:57:28,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 21:57:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.303030303030303) internal successors, (43), 33 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 21:57:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2024-11-09 21:57:28,715 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 18 [2024-11-09 21:57:28,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:28,716 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2024-11-09 21:57:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,717 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2024-11-09 21:57:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 21:57:28,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:28,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:28,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:57:28,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:28,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:28,721 INFO L85 PathProgramCache]: Analyzing trace with hash -151291999, now seen corresponding path program 1 times [2024-11-09 21:57:28,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:28,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616911505] [2024-11-09 21:57:28,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:28,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:28,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:28,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616911505] [2024-11-09 21:57:28,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616911505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:28,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:28,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:28,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62053789] [2024-11-09 21:57:28,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:28,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:28,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:28,862 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:28,877 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-11-09 21:57:28,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:28,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-09 21:57:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:28,880 INFO L225 Difference]: With dead ends: 45 [2024-11-09 21:57:28,880 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 21:57:28,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:28,881 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:28,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 21:57:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 21:57:28,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 21:57:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2024-11-09 21:57:28,889 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 18 [2024-11-09 21:57:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:28,889 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2024-11-09 21:57:28,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2024-11-09 21:57:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 21:57:28,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:28,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:57:28,891 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -348033293, now seen corresponding path program 1 times [2024-11-09 21:57:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812130883] [2024-11-09 21:57:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:57:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:28,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812130883] [2024-11-09 21:57:28,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812130883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:28,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:28,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:57:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527186072] [2024-11-09 21:57:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:28,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:57:28,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:28,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:57:28,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:28,926 INFO L87 Difference]: Start difference. First operand 40 states and 53 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:28,942 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-11-09 21:57:28,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:57:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-09 21:57:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:28,945 INFO L225 Difference]: With dead ends: 57 [2024-11-09 21:57:28,945 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 21:57:28,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-09 21:57:28,946 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:28,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 21:57:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 21:57:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 21:57:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-09 21:57:28,956 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 23 [2024-11-09 21:57:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-09 21:57:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 21:57:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-09 21:57:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 21:57:28,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:28,958 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:28,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:57:28,959 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1503546338, now seen corresponding path program 1 times [2024-11-09 21:57:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:28,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770088621] [2024-11-09 21:57:28,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 21:57:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 21:57:29,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770088621] [2024-11-09 21:57:29,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770088621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:29,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:29,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957065740] [2024-11-09 21:57:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:29,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,026 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:57:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,043 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2024-11-09 21:57:29,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:29,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 21:57:29,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,044 INFO L225 Difference]: With dead ends: 67 [2024-11-09 21:57:29,044 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 21:57:29,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,046 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:29,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 21:57:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 21:57:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 21:57:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2024-11-09 21:57:29,051 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 29 [2024-11-09 21:57:29,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,051 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2024-11-09 21:57:29,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 21:57:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2024-11-09 21:57:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 21:57:29,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,052 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 21:57:29,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1644400558, now seen corresponding path program 1 times [2024-11-09 21:57:29,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141889287] [2024-11-09 21:57:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 21:57:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-09 21:57:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 21:57:29,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141889287] [2024-11-09 21:57:29,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141889287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:29,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51569648] [2024-11-09 21:57:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:29,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,144 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 21:57:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,167 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2024-11-09 21:57:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-09 21:57:29,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,168 INFO L225 Difference]: With dead ends: 71 [2024-11-09 21:57:29,170 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 21:57:29,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,171 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:29,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 21:57:29,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-09 21:57:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-09 21:57:29,176 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 35 [2024-11-09 21:57:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,176 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-09 21:57:29,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 21:57:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-09 21:57:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 21:57:29,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,177 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 21:57:29,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,178 INFO L85 PathProgramCache]: Analyzing trace with hash -129115327, now seen corresponding path program 1 times [2024-11-09 21:57:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22550469] [2024-11-09 21:57:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 21:57:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22550469] [2024-11-09 21:57:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22550469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:57:29,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106091940] [2024-11-09 21:57:29,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:57:29,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:57:29,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:29,241 INFO L87 Difference]: Start difference. First operand 36 states and 43 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,255 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2024-11-09 21:57:29,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:57:29,256 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-09 21:57:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,256 INFO L225 Difference]: With dead ends: 53 [2024-11-09 21:57:29,257 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 21:57:29,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-09 21:57:29,258 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:29,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 21:57:29,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-09 21:57:29,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-09 21:57:29,262 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 41 [2024-11-09 21:57:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,262 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-09 21:57:29,262 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, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-09 21:57:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 21:57:29,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,263 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 21:57:29,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1047955495, now seen corresponding path program 1 times [2024-11-09 21:57:29,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856396511] [2024-11-09 21:57:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 21:57:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856396511] [2024-11-09 21:57:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856396511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:29,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 21:57:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387080131] [2024-11-09 21:57:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 21:57:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 21:57:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 21:57:29,319 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,329 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-09 21:57:29,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 21:57:29,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-09 21:57:29,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,331 INFO L225 Difference]: With dead ends: 58 [2024-11-09 21:57:29,332 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 21:57:29,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-11-09 21:57:29,333 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 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-09 21:57:29,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 21:57:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-11-09 21:57:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2024-11-09 21:57:29,341 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 44 [2024-11-09 21:57:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,341 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2024-11-09 21:57:29,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2024-11-09 21:57:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 21:57:29,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,342 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 21:57:29,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1334076965, now seen corresponding path program 1 times [2024-11-09 21:57:29,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757085330] [2024-11-09 21:57:29,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 21:57:29,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757085330] [2024-11-09 21:57:29,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757085330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:29,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758328751] [2024-11-09 21:57:29,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:29,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:29,419 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:29,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 21:57:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 21:57:29,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:29,550 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 21:57:29,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-09 21:57:29,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758328751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:29,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:29,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 21:57:29,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722272942] [2024-11-09 21:57:29,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 21:57:29,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 21:57:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:57:29,617 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,650 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2024-11-09 21:57:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:57:29,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-09 21:57:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,653 INFO L225 Difference]: With dead ends: 70 [2024-11-09 21:57:29,653 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 21:57:29,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:57:29,654 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:29,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 150 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 21:57:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 21:57:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 states have internal predecessors, (54), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-11-09 21:57:29,660 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 48 [2024-11-09 21:57:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,661 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-11-09 21:57:29,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-11-09 21:57:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-09 21:57:29,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,664 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 21:57:29,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:29,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash -699865569, now seen corresponding path program 2 times [2024-11-09 21:57:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566199762] [2024-11-09 21:57:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 21:57:29,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:29,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566199762] [2024-11-09 21:57:29,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566199762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:57:29,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:57:29,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:57:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738884750] [2024-11-09 21:57:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:57:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:57:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:29,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:57:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,945 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:29,960 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-09 21:57:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:57:29,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 60 [2024-11-09 21:57:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:29,961 INFO L225 Difference]: With dead ends: 59 [2024-11-09 21:57:29,961 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 21:57:29,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:57:29,962 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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-09 21:57:29,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 21:57:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 21:57:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-09 21:57:29,965 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 60 [2024-11-09 21:57:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:29,966 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-09 21:57:29,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-09 21:57:29,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 21:57:29,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:29,969 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:29,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 21:57:29,969 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:29,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash -793536402, now seen corresponding path program 1 times [2024-11-09 21:57:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:29,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433939616] [2024-11-09 21:57:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:30,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 21:57:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433939616] [2024-11-09 21:57:30,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433939616] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33484930] [2024-11-09 21:57:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:30,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:30,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:30,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:30,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 21:57:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:30,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 21:57:30,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 21:57:30,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 21:57:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33484930] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:30,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-09 21:57:30,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15799998] [2024-11-09 21:57:30,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:30,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 21:57:30,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 21:57:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:57:30,224 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:30,256 INFO L93 Difference]: Finished difference Result 126 states and 152 transitions. [2024-11-09 21:57:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:57:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2024-11-09 21:57:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:30,259 INFO L225 Difference]: With dead ends: 126 [2024-11-09 21:57:30,259 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 21:57:30,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 21:57:30,260 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 19 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:30,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 142 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:57:30,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 21:57:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-09 21:57:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 112 states have internal predecessors, (134), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2024-11-09 21:57:30,271 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 63 [2024-11-09 21:57:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:30,272 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2024-11-09 21:57:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2024-11-09 21:57:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:30,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:30,274 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 16, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:30,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 21:57:30,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 21:57:30,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:30,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:30,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1601909109, now seen corresponding path program 2 times [2024-11-09 21:57:30,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:30,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828156034] [2024-11-09 21:57:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:30,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:31,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 343 proven. 123 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-09 21:57:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828156034] [2024-11-09 21:57:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828156034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171378538] [2024-11-09 21:57:31,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:57:31,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:31,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:31,149 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:31,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 21:57:31,256 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:57:31,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:31,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 21:57:31,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:31,621 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 348 proven. 132 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 21:57:31,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:31,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:57:31,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 21:57:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 348 proven. 118 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-09 21:57:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171378538] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:31,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:31,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 35 [2024-11-09 21:57:31,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607164596] [2024-11-09 21:57:31,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:31,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 21:57:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:31,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 21:57:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 21:57:31,939 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:34,485 INFO L93 Difference]: Finished difference Result 488 states and 605 transitions. [2024-11-09 21:57:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-09 21:57:34,487 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:57:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:34,488 INFO L225 Difference]: With dead ends: 488 [2024-11-09 21:57:34,488 INFO L226 Difference]: Without dead ends: 380 [2024-11-09 21:57:34,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4736 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1320, Invalid=13200, Unknown=0, NotChecked=0, Total=14520 [2024-11-09 21:57:34,494 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 316 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:34,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1009 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 21:57:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-09 21:57:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 327. [2024-11-09 21:57:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 321 states have (on average 1.2305295950155763) internal successors, (395), 321 states have internal predecessors, (395), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:34,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 403 transitions. [2024-11-09 21:57:34,519 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 403 transitions. Word has length 129 [2024-11-09 21:57:34,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:34,519 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 403 transitions. [2024-11-09 21:57:34,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:34,520 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 403 transitions. [2024-11-09 21:57:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:34,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:34,521 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 13, 5, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 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-09 21:57:34,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 21:57:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:34,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:34,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1603947896, now seen corresponding path program 1 times [2024-11-09 21:57:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:34,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571879480] [2024-11-09 21:57:34,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 349 proven. 117 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-09 21:57:35,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:35,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571879480] [2024-11-09 21:57:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571879480] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:35,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785861315] [2024-11-09 21:57:35,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:35,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:35,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:35,305 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:35,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 21:57:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:35,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 21:57:35,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 264 proven. 340 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-09 21:57:35,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:36,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:57:36,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 21:57:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 265 proven. 315 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-09 21:57:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785861315] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:36,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:36,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 15] total 47 [2024-11-09 21:57:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619924803] [2024-11-09 21:57:36,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:36,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 21:57:36,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 21:57:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1986, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 21:57:36,344 INFO L87 Difference]: Start difference. First operand 327 states and 403 transitions. Second operand has 47 states, 47 states have (on average 3.8297872340425534) internal successors, (180), 47 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:44,088 INFO L93 Difference]: Finished difference Result 2086 states and 2584 transitions. [2024-11-09 21:57:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 324 states. [2024-11-09 21:57:44,089 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.8297872340425534) internal successors, (180), 47 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:57:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:44,095 INFO L225 Difference]: With dead ends: 2086 [2024-11-09 21:57:44,095 INFO L226 Difference]: Without dead ends: 1821 [2024-11-09 21:57:44,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50016 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6687, Invalid=112683, Unknown=0, NotChecked=0, Total=119370 [2024-11-09 21:57:44,111 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1363 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 4256 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1363 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 4302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:44,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1363 Valid, 1626 Invalid, 4302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4256 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 21:57:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2024-11-09 21:57:44,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1261. [2024-11-09 21:57:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1255 states have (on average 1.2334661354581673) internal successors, (1548), 1255 states have internal predecessors, (1548), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1556 transitions. [2024-11-09 21:57:44,168 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1556 transitions. Word has length 129 [2024-11-09 21:57:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 1556 transitions. [2024-11-09 21:57:44,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.8297872340425534) internal successors, (180), 47 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1556 transitions. [2024-11-09 21:57:44,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:44,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:44,171 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:44,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 21:57:44,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:44,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:44,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash -215070214, now seen corresponding path program 2 times [2024-11-09 21:57:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:44,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462272139] [2024-11-09 21:57:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:44,892 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 153 proven. 435 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-09 21:57:44,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:44,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462272139] [2024-11-09 21:57:44,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462272139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:44,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122855453] [2024-11-09 21:57:44,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 21:57:44,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:44,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:44,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 21:57:44,983 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 21:57:44,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:44,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 21:57:44,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:45,199 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 32 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-09 21:57:45,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:45,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:57:45,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-09 21:57:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 32 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-09 21:57:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122855453] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:45,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:45,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 33 [2024-11-09 21:57:45,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401024790] [2024-11-09 21:57:45,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 21:57:45,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:45,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 21:57:45,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 21:57:45,352 INFO L87 Difference]: Start difference. First operand 1261 states and 1556 transitions. Second operand has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 states have internal predecessors, (136), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:46,958 INFO L93 Difference]: Finished difference Result 2699 states and 3344 transitions. [2024-11-09 21:57:46,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-09 21:57:46,959 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 states have internal predecessors, (136), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:57:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:46,963 INFO L225 Difference]: With dead ends: 2699 [2024-11-09 21:57:46,963 INFO L226 Difference]: Without dead ends: 1727 [2024-11-09 21:57:46,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2446 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1018, Invalid=7354, Unknown=0, NotChecked=0, Total=8372 [2024-11-09 21:57:46,965 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 139 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:46,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1281 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 21:57:46,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-11-09 21:57:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1641. [2024-11-09 21:57:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1635 states have (on average 1.236085626911315) internal successors, (2021), 1635 states have internal predecessors, (2021), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2029 transitions. [2024-11-09 21:57:47,021 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2029 transitions. Word has length 129 [2024-11-09 21:57:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:47,022 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2029 transitions. [2024-11-09 21:57:47,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.121212121212121) internal successors, (136), 33 states have internal predecessors, (136), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2029 transitions. [2024-11-09 21:57:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:47,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:47,025 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 9, 7, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:47,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 21:57:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 21:57:47,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:47,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash -966655556, now seen corresponding path program 3 times [2024-11-09 21:57:47,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:47,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939870222] [2024-11-09 21:57:47,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:47,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 12 proven. 573 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 21:57:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939870222] [2024-11-09 21:57:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939870222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412713753] [2024-11-09 21:57:47,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 21:57:47,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:47,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:47,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:47,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 21:57:47,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 21:57:47,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:47,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-09 21:57:47,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:48,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:57:48,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 27 [2024-11-09 21:57:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 252 proven. 40 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-09 21:57:48,254 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 260 proven. 32 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2024-11-09 21:57:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412713753] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:48,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 13] total 41 [2024-11-09 21:57:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210072641] [2024-11-09 21:57:48,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 21:57:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 21:57:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=1314, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 21:57:48,587 INFO L87 Difference]: Start difference. First operand 1641 states and 2029 transitions. Second operand has 41 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 41 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:51,903 INFO L93 Difference]: Finished difference Result 3832 states and 4713 transitions. [2024-11-09 21:57:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-11-09 21:57:51,903 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 41 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:57:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:51,911 INFO L225 Difference]: With dead ends: 3832 [2024-11-09 21:57:51,911 INFO L226 Difference]: Without dead ends: 3598 [2024-11-09 21:57:51,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9259 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4788, Invalid=19392, Unknown=0, NotChecked=0, Total=24180 [2024-11-09 21:57:51,913 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 412 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 3003 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 3051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:51,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1382 Invalid, 3051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3003 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 21:57:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3598 states. [2024-11-09 21:57:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3598 to 1725. [2024-11-09 21:57:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1719 states have (on average 1.2408376963350785) internal successors, (2133), 1719 states have internal predecessors, (2133), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2141 transitions. [2024-11-09 21:57:51,994 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2141 transitions. Word has length 129 [2024-11-09 21:57:51,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:51,994 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2141 transitions. [2024-11-09 21:57:51,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.7560975609756095) internal successors, (154), 41 states have internal predecessors, (154), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2141 transitions. [2024-11-09 21:57:51,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:51,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:51,997 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 10, 6, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:52,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 21:57:52,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:52,198 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:52,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash 395251071, now seen corresponding path program 4 times [2024-11-09 21:57:52,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:52,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008452530] [2024-11-09 21:57:52,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:52,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 349 proven. 143 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-09 21:57:52,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008452530] [2024-11-09 21:57:52,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008452530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:52,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382147488] [2024-11-09 21:57:52,626 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 21:57:52,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:52,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:52,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:52,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 21:57:52,716 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 21:57:52,716 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:52,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 21:57:52,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:52,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-09 21:57:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 363 proven. 61 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-09 21:57:52,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:53,018 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-09 21:57:53,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2024-11-09 21:57:53,036 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 335 proven. 89 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-09 21:57:53,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382147488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:53,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:53,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2024-11-09 21:57:53,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348111437] [2024-11-09 21:57:53,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:53,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 21:57:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 21:57:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-09 21:57:53,037 INFO L87 Difference]: Start difference. First operand 1725 states and 2141 transitions. Second operand has 25 states, 25 states have (on average 4.52) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:57:54,049 INFO L93 Difference]: Finished difference Result 4717 states and 5890 transitions. [2024-11-09 21:57:54,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-11-09 21:57:54,049 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.52) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:57:54,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:57:54,058 INFO L225 Difference]: With dead ends: 4717 [2024-11-09 21:57:54,058 INFO L226 Difference]: Without dead ends: 3391 [2024-11-09 21:57:54,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 253 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=520, Invalid=4736, Unknown=0, NotChecked=0, Total=5256 [2024-11-09 21:57:54,061 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 142 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 21:57:54,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 660 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 21:57:54,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2024-11-09 21:57:54,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 2974. [2024-11-09 21:57:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2974 states, 2968 states have (on average 1.2247304582210243) internal successors, (3635), 2968 states have internal predecessors, (3635), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:57:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 3643 transitions. [2024-11-09 21:57:54,224 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 3643 transitions. Word has length 129 [2024-11-09 21:57:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:57:54,224 INFO L471 AbstractCegarLoop]: Abstraction has 2974 states and 3643 transitions. [2024-11-09 21:57:54,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.52) internal successors, (113), 25 states have internal predecessors, (113), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:57:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 3643 transitions. [2024-11-09 21:57:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:57:54,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:57:54,228 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:57:54,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 21:57:54,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:54,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:57:54,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:57:54,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2003935424, now seen corresponding path program 5 times [2024-11-09 21:57:54,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:57:54,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439110367] [2024-11-09 21:57:54,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:57:54,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:57:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:57:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:54,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:57:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:54,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:57:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:54,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:57:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:57:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 335 proven. 229 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 21:57:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:57:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439110367] [2024-11-09 21:57:54,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439110367] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:57:54,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348696150] [2024-11-09 21:57:54,765 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 21:57:54,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:57:54,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:57:54,767 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:57:54,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 21:57:54,839 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-11-09 21:57:54,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:57:54,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 21:57:54,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:57:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 31 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2024-11-09 21:57:55,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:57:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 370 proven. 55 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2024-11-09 21:57:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348696150] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:57:55,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:57:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 18] total 41 [2024-11-09 21:57:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38067904] [2024-11-09 21:57:55,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:57:55,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 21:57:55,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:57:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 21:57:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1425, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 21:57:55,584 INFO L87 Difference]: Start difference. First operand 2974 states and 3643 transitions. Second operand has 41 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:58:04,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:19,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:28,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:32,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:45,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:54,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 21:58:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:58:55,707 INFO L93 Difference]: Finished difference Result 31013 states and 38841 transitions. [2024-11-09 21:58:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 561 states. [2024-11-09 21:58:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 129 [2024-11-09 21:58:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:58:55,766 INFO L225 Difference]: With dead ends: 31013 [2024-11-09 21:58:55,766 INFO L226 Difference]: Without dead ends: 26505 [2024-11-09 21:58:55,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 841 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 575 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145660 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=24659, Invalid=307691, Unknown=2, NotChecked=0, Total=332352 [2024-11-09 21:58:55,789 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 456 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 5491 mSolverCounterSat, 148 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 5644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 5491 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2024-11-09 21:58:55,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1762 Invalid, 5644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 5491 Invalid, 5 Unknown, 0 Unchecked, 26.3s Time] [2024-11-09 21:58:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26505 states. [2024-11-09 21:58:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26505 to 13613. [2024-11-09 21:58:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13613 states, 13607 states have (on average 1.2667744543249797) internal successors, (17237), 13607 states have internal predecessors, (17237), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 21:58:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13613 states to 13613 states and 17245 transitions. [2024-11-09 21:58:57,063 INFO L78 Accepts]: Start accepts. Automaton has 13613 states and 17245 transitions. Word has length 129 [2024-11-09 21:58:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:58:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 13613 states and 17245 transitions. [2024-11-09 21:58:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.341463414634146) internal successors, (137), 41 states have internal predecessors, (137), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 21:58:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 13613 states and 17245 transitions. [2024-11-09 21:58:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 21:58:57,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:58:57,078 INFO L215 NwaCegarLoop]: trace histogram [20, 16, 16, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:58:57,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 21:58:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 21:58:57,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:58:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:58:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 873319549, now seen corresponding path program 6 times [2024-11-09 21:58:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:58:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411806068] [2024-11-09 21:58:57,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:58:57,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:58:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 21:58:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-09 21:58:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 21:58:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 21:58:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:58:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 473 proven. 95 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-09 21:58:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:58:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411806068] [2024-11-09 21:58:57,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411806068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:58:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547848299] [2024-11-09 21:58:57,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 21:58:57,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:58:57,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:58:57,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 21:58:57,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 21:58:57,796 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-09 21:58:57,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 21:58:57,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 21:58:57,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:58:57,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:58:57,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2024-11-09 21:58:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 252 proven. 128 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2024-11-09 21:58:58,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:58:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 316 proven. 18 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-09 21:58:58,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547848299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:58:58,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:58:58,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 30 [2024-11-09 21:58:58,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629773133] [2024-11-09 21:58:58,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:58:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 21:58:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:58:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 21:58:58,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-09 21:58:58,162 INFO L87 Difference]: Start difference. First operand 13613 states and 17245 transitions. Second operand has 30 states, 30 states have (on average 4.366666666666666) internal successors, (131), 30 states have internal predecessors, (131), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)