./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:45:52,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:45:52,768 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:45:52,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:45:52,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:45:52,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:45:52,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:45:52,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:45:52,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:45:52,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:45:52,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:45:52,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:45:52,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:45:52,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:45:52,799 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:45:52,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:45:52,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:45:52,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:45:52,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:45:52,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:45:52,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:45:52,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:45:52,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:45:52,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:45:52,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:45:52,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:45:52,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:45:52,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:45:52,804 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:45:52,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:45:52,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:45:52,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:45:52,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:45:52,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:45:52,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:45:52,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:45:52,806 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:45:52,807 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-11-16 16:45:53,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:45:53,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:45:53,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:45:53,024 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:45:53,024 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:45:53,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:45:54,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:45:54,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:45:54,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:45:54,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad6ec4f1/00031310c6b84857b40640e09dd629d9/FLAG5b49e61d4 [2024-11-16 16:45:54,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ad6ec4f1/00031310c6b84857b40640e09dd629d9 [2024-11-16 16:45:54,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:45:54,523 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:45:54,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:45:54,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:45:54,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:45:54,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@697dd727 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54, skipping insertion in model container [2024-11-16 16:45:54,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:45:54,662 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-16 16:45:54,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:45:54,725 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:45:54,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-16 16:45:54,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:45:54,770 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:45:54,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54 WrapperNode [2024-11-16 16:45:54,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:45:54,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:45:54,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:45:54,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:45:54,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,818 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-16 16:45:54,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:45:54,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:45:54,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:45:54,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:45:54,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,845 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:45:54,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,853 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:45:54,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:45:54,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:45:54,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:45:54,874 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (1/1) ... [2024-11-16 16:45:54,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:45:54,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:45:54,924 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-16 16:45:54,928 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-16 16:45:54,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:45:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:45:54,960 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:45:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:45:54,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:45:54,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:45:55,023 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:45:55,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:45:55,240 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-16 16:45:55,263 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 16:45:55,267 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:45:55,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:45:55,295 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:45:55,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:45:55 BoogieIcfgContainer [2024-11-16 16:45:55,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:45:55,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:45:55,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:45:55,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:45:55,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:45:54" (1/3) ... [2024-11-16 16:45:55,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65853f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:45:55, skipping insertion in model container [2024-11-16 16:45:55,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:45:54" (2/3) ... [2024-11-16 16:45:55,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65853f1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:45:55, skipping insertion in model container [2024-11-16 16:45:55,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:45:55" (3/3) ... [2024-11-16 16:45:55,305 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:45:55,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:45:55,318 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:45:55,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:45:55,364 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;@a996b5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:45:55,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:45:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:55,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 16:45:55,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:55,376 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:55,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:55,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:55,380 INFO L85 PathProgramCache]: Analyzing trace with hash -592616479, now seen corresponding path program 1 times [2024-11-16 16:45:55,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:55,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359247257] [2024-11-16 16:45:55,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:55,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:55,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359247257] [2024-11-16 16:45:55,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359247257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:55,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:55,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:45:55,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086986868] [2024-11-16 16:45:55,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:55,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:45:55,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:55,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:45:55,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:45:55,686 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:45:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:55,748 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2024-11-16 16:45:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:45:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-11-16 16:45:55,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:55,756 INFO L225 Difference]: With dead ends: 146 [2024-11-16 16:45:55,757 INFO L226 Difference]: Without dead ends: 70 [2024-11-16 16:45:55,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:45:55,763 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:55,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:45:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-16 16:45:55,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-16 16:45:55,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-11-16 16:45:55,801 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 118 [2024-11-16 16:45:55,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:55,801 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-11-16 16:45:55,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:45:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-11-16 16:45:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 16:45:55,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:55,804 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:55,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:45:55,805 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:55,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:55,805 INFO L85 PathProgramCache]: Analyzing trace with hash -471719225, now seen corresponding path program 1 times [2024-11-16 16:45:55,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:55,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823878109] [2024-11-16 16:45:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:55,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:55,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:56,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823878109] [2024-11-16 16:45:56,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823878109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:56,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:56,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:45:56,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501603659] [2024-11-16 16:45:56,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:56,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:45:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:56,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:45:56,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:45:56,028 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:56,114 INFO L93 Difference]: Finished difference Result 169 states and 244 transitions. [2024-11-16 16:45:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:45:56,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-16 16:45:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:56,117 INFO L225 Difference]: With dead ends: 169 [2024-11-16 16:45:56,117 INFO L226 Difference]: Without dead ends: 102 [2024-11-16 16:45:56,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:45:56,119 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:56,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 195 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:45:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-16 16:45:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-11-16 16:45:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-16 16:45:56,135 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 118 [2024-11-16 16:45:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:56,136 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-16 16:45:56,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-16 16:45:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-16 16:45:56,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:56,138 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:45:56,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1981703847, now seen corresponding path program 1 times [2024-11-16 16:45:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033436251] [2024-11-16 16:45:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:56,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033436251] [2024-11-16 16:45:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033436251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:56,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:56,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:45:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458544426] [2024-11-16 16:45:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:56,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:45:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:56,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:45:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:45:56,757 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:57,047 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-11-16 16:45:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:45:57,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-16 16:45:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:57,049 INFO L225 Difference]: With dead ends: 270 [2024-11-16 16:45:57,049 INFO L226 Difference]: Without dead ends: 190 [2024-11-16 16:45:57,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:45:57,051 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 218 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:57,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 337 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:45:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-16 16:45:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 104. [2024-11-16 16:45:57,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:57,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-16 16:45:57,061 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 118 [2024-11-16 16:45:57,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:57,062 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-16 16:45:57,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:57,062 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-16 16:45:57,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 16:45:57,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:57,067 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:57,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:45:57,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:57,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:57,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1830585519, now seen corresponding path program 1 times [2024-11-16 16:45:57,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:57,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498273331] [2024-11-16 16:45:57,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:57,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:57,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:57,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498273331] [2024-11-16 16:45:57,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498273331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:45:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89542209] [2024-11-16 16:45:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:45:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:57,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:45:57,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:45:57,582 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:57,877 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2024-11-16 16:45:57,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:45:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-16 16:45:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:57,885 INFO L225 Difference]: With dead ends: 269 [2024-11-16 16:45:57,885 INFO L226 Difference]: Without dead ends: 168 [2024-11-16 16:45:57,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:45:57,887 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:57,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 884 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:45:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-16 16:45:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2024-11-16 16:45:57,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-16 16:45:57,900 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 119 [2024-11-16 16:45:57,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:57,900 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-16 16:45:57,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-16 16:45:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:45:57,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:57,902 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:45:57,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:57,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1483513283, now seen corresponding path program 1 times [2024-11-16 16:45:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:57,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025342445] [2024-11-16 16:45:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:57,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:58,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:58,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025342445] [2024-11-16 16:45:58,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025342445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:58,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:58,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:45:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68228192] [2024-11-16 16:45:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:58,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:45:58,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:45:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:45:58,300 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:58,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:58,509 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2024-11-16 16:45:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:45:58,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:45:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:58,511 INFO L225 Difference]: With dead ends: 290 [2024-11-16 16:45:58,511 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 16:45:58,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:45:58,513 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:58,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 854 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:45:58,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 16:45:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2024-11-16 16:45:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-16 16:45:58,519 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 120 [2024-11-16 16:45:58,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:58,519 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-16 16:45:58,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-16 16:45:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:45:58,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:58,520 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:58,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:45:58,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:58,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:58,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2075905340, now seen corresponding path program 1 times [2024-11-16 16:45:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:58,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967537654] [2024-11-16 16:45:58,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:58,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:45:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:45:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:45:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:45:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:45:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:45:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:45:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:45:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:45:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:45:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:45:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:45:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:45:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:45:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:45:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:45:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:45:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:45:59,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:45:59,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967537654] [2024-11-16 16:45:59,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967537654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:45:59,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:45:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:45:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677165488] [2024-11-16 16:45:59,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:45:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:45:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:45:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:45:59,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:45:59,108 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:59,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:45:59,727 INFO L93 Difference]: Finished difference Result 341 states and 486 transitions. [2024-11-16 16:45:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:45:59,727 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-16 16:45:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:45:59,728 INFO L225 Difference]: With dead ends: 341 [2024-11-16 16:45:59,728 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 16:45:59,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:45:59,729 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 172 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:45:59,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 904 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:45:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 16:45:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2024-11-16 16:45:59,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:45:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-16 16:45:59,742 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 120 [2024-11-16 16:45:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:45:59,742 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-16 16:45:59,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:45:59,743 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-16 16:45:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:45:59,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:45:59,743 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:45:59,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:45:59,744 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:45:59,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:45:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash 355188204, now seen corresponding path program 1 times [2024-11-16 16:45:59,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:45:59,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112555046] [2024-11-16 16:45:59,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:45:59,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:45:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:00,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:00,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112555046] [2024-11-16 16:46:00,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112555046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:00,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:00,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 16:46:00,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560576842] [2024-11-16 16:46:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:00,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 16:46:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:00,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 16:46:00,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:46:00,319 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:00,908 INFO L93 Difference]: Finished difference Result 354 states and 486 transitions. [2024-11-16 16:46:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:46:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:00,910 INFO L225 Difference]: With dead ends: 354 [2024-11-16 16:46:00,910 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 16:46:00,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-16 16:46:00,911 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 166 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:00,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1103 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:46:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 16:46:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 137. [2024-11-16 16:46:00,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:46:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2024-11-16 16:46:00,917 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 121 [2024-11-16 16:46:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:00,917 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2024-11-16 16:46:00,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2024-11-16 16:46:00,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:46:00,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:00,918 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:00,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:46:00,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:00,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1100131932, now seen corresponding path program 1 times [2024-11-16 16:46:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:00,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228739775] [2024-11-16 16:46:00,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:01,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:01,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:01,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228739775] [2024-11-16 16:46:01,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228739775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:01,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:01,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 16:46:01,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602103672] [2024-11-16 16:46:01,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:01,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 16:46:01,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:01,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 16:46:01,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:46:01,700 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:02,150 INFO L93 Difference]: Finished difference Result 467 states and 627 transitions. [2024-11-16 16:46:02,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 16:46:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:02,152 INFO L225 Difference]: With dead ends: 467 [2024-11-16 16:46:02,152 INFO L226 Difference]: Without dead ends: 333 [2024-11-16 16:46:02,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-16 16:46:02,153 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 224 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:02,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 728 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 16:46:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-16 16:46:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 249. [2024-11-16 16:46:02,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.3464912280701755) internal successors, (307), 229 states have internal predecessors, (307), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:46:02,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2024-11-16 16:46:02,162 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 121 [2024-11-16 16:46:02,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2024-11-16 16:46:02,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2024-11-16 16:46:02,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:46:02,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:02,163 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:46:02,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -678881924, now seen corresponding path program 1 times [2024-11-16 16:46:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772182515] [2024-11-16 16:46:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:02,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772182515] [2024-11-16 16:46:02,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772182515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:02,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:46:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348019838] [2024-11-16 16:46:02,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:02,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:46:02,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:02,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:46:02,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,217 INFO L87 Difference]: Start difference. First operand 249 states and 343 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:02,250 INFO L93 Difference]: Finished difference Result 657 states and 898 transitions. [2024-11-16 16:46:02,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:46:02,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:02,254 INFO L225 Difference]: With dead ends: 657 [2024-11-16 16:46:02,254 INFO L226 Difference]: Without dead ends: 411 [2024-11-16 16:46:02,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,255 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:02,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-16 16:46:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 283. [2024-11-16 16:46:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 263 states have internal predecessors, (347), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:46:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 383 transitions. [2024-11-16 16:46:02,264 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 383 transitions. Word has length 121 [2024-11-16 16:46:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:02,264 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 383 transitions. [2024-11-16 16:46:02,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 383 transitions. [2024-11-16 16:46:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:46:02,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:02,265 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:02,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 16:46:02,266 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1592484815, now seen corresponding path program 1 times [2024-11-16 16:46:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806507309] [2024-11-16 16:46:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:02,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:02,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806507309] [2024-11-16 16:46:02,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806507309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:02,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:02,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:46:02,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473742698] [2024-11-16 16:46:02,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:02,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:46:02,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:46:02,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,345 INFO L87 Difference]: Start difference. First operand 283 states and 383 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:02,375 INFO L93 Difference]: Finished difference Result 684 states and 919 transitions. [2024-11-16 16:46:02,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:46:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:02,377 INFO L225 Difference]: With dead ends: 684 [2024-11-16 16:46:02,377 INFO L226 Difference]: Without dead ends: 404 [2024-11-16 16:46:02,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,378 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 85 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:02,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 190 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:02,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-16 16:46:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 335. [2024-11-16 16:46:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.3121019108280254) internal successors, (412), 315 states have internal predecessors, (412), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:46:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2024-11-16 16:46:02,386 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 121 [2024-11-16 16:46:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:02,386 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2024-11-16 16:46:02,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2024-11-16 16:46:02,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:46:02,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:02,388 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:02,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:46:02,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:02,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1013486799, now seen corresponding path program 1 times [2024-11-16 16:46:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032754473] [2024-11-16 16:46:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032754473] [2024-11-16 16:46:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032754473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:02,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:02,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:46:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324586948] [2024-11-16 16:46:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:02,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:46:02,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:02,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:46:02,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,451 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:02,486 INFO L93 Difference]: Finished difference Result 734 states and 978 transitions. [2024-11-16 16:46:02,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:46:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:02,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:02,488 INFO L225 Difference]: With dead ends: 734 [2024-11-16 16:46:02,488 INFO L226 Difference]: Without dead ends: 402 [2024-11-16 16:46:02,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:02,489 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:02,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-16 16:46:02,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 335. [2024-11-16 16:46:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.305732484076433) internal successors, (410), 315 states have internal predecessors, (410), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:46:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 446 transitions. [2024-11-16 16:46:02,497 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 446 transitions. Word has length 121 [2024-11-16 16:46:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:02,497 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 446 transitions. [2024-11-16 16:46:02,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 446 transitions. [2024-11-16 16:46:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:46:02,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:02,499 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:02,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 16:46:02,499 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:02,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:02,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1033125179, now seen corresponding path program 1 times [2024-11-16 16:46:02,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:02,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568173356] [2024-11-16 16:46:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:02,651 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:02,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568173356] [2024-11-16 16:46:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568173356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:02,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:46:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599546824] [2024-11-16 16:46:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:02,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:46:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:02,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:46:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:46:02,653 INFO L87 Difference]: Start difference. First operand 335 states and 446 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:02,862 INFO L93 Difference]: Finished difference Result 858 states and 1151 transitions. [2024-11-16 16:46:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:46:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-16 16:46:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:02,864 INFO L225 Difference]: With dead ends: 858 [2024-11-16 16:46:02,864 INFO L226 Difference]: Without dead ends: 526 [2024-11-16 16:46:02,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:46:02,865 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 125 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:02,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 401 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:46:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-16 16:46:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 519. [2024-11-16 16:46:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 463 states have (on average 1.285097192224622) internal successors, (595), 465 states have internal predecessors, (595), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:46:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 695 transitions. [2024-11-16 16:46:02,881 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 695 transitions. Word has length 121 [2024-11-16 16:46:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:02,881 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 695 transitions. [2024-11-16 16:46:02,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:02,882 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 695 transitions. [2024-11-16 16:46:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:02,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:02,883 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:02,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 16:46:02,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:02,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:02,883 INFO L85 PathProgramCache]: Analyzing trace with hash 768441574, now seen corresponding path program 1 times [2024-11-16 16:46:02,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:02,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336505771] [2024-11-16 16:46:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:02,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:03,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336505771] [2024-11-16 16:46:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336505771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 16:46:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089744174] [2024-11-16 16:46:03,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:03,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 16:46:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:03,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 16:46:03,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:46:03,183 INFO L87 Difference]: Start difference. First operand 519 states and 695 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:03,384 INFO L93 Difference]: Finished difference Result 1026 states and 1349 transitions. [2024-11-16 16:46:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:46:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:03,387 INFO L225 Difference]: With dead ends: 1026 [2024-11-16 16:46:03,387 INFO L226 Difference]: Without dead ends: 694 [2024-11-16 16:46:03,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-16 16:46:03,388 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 81 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:03,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 822 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:46:03,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-16 16:46:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 525. [2024-11-16 16:46:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 469 states have (on average 1.2857142857142858) internal successors, (603), 471 states have internal predecessors, (603), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:46:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 703 transitions. [2024-11-16 16:46:03,406 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 703 transitions. Word has length 122 [2024-11-16 16:46:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 703 transitions. [2024-11-16 16:46:03,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 703 transitions. [2024-11-16 16:46:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:03,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:03,408 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:03,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 16:46:03,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:03,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:03,408 INFO L85 PathProgramCache]: Analyzing trace with hash -121454523, now seen corresponding path program 1 times [2024-11-16 16:46:03,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:03,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385686995] [2024-11-16 16:46:03,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:03,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:03,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385686995] [2024-11-16 16:46:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385686995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:03,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:03,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 16:46:03,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029715210] [2024-11-16 16:46:03,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:03,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:46:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:03,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:46:03,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 16:46:03,858 INFO L87 Difference]: Start difference. First operand 525 states and 703 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:04,144 INFO L93 Difference]: Finished difference Result 928 states and 1232 transitions. [2024-11-16 16:46:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 16:46:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:04,146 INFO L225 Difference]: With dead ends: 928 [2024-11-16 16:46:04,147 INFO L226 Difference]: Without dead ends: 590 [2024-11-16 16:46:04,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-16 16:46:04,148 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 118 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:04,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 549 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:46:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-16 16:46:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 533. [2024-11-16 16:46:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 477 states have (on average 1.2893081761006289) internal successors, (615), 479 states have internal predecessors, (615), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:46:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 715 transitions. [2024-11-16 16:46:04,168 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 715 transitions. Word has length 122 [2024-11-16 16:46:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:04,168 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 715 transitions. [2024-11-16 16:46:04,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 715 transitions. [2024-11-16 16:46:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:04,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:04,170 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:04,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 16:46:04,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:04,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:04,171 INFO L85 PathProgramCache]: Analyzing trace with hash 10230261, now seen corresponding path program 1 times [2024-11-16 16:46:04,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:04,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983956205] [2024-11-16 16:46:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:04,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,225 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:04,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983956205] [2024-11-16 16:46:04,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983956205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:04,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:04,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:46:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705413923] [2024-11-16 16:46:04,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:04,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:46:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:04,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:46:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:04,227 INFO L87 Difference]: Start difference. First operand 533 states and 715 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:04,275 INFO L93 Difference]: Finished difference Result 1159 states and 1553 transitions. [2024-11-16 16:46:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:46:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:04,278 INFO L225 Difference]: With dead ends: 1159 [2024-11-16 16:46:04,278 INFO L226 Difference]: Without dead ends: 666 [2024-11-16 16:46:04,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:04,280 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 76 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:04,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 242 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:04,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-16 16:46:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 504. [2024-11-16 16:46:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 448 states have (on average 1.2700892857142858) internal successors, (569), 450 states have internal predecessors, (569), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:46:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 669 transitions. [2024-11-16 16:46:04,303 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 669 transitions. Word has length 122 [2024-11-16 16:46:04,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:04,303 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 669 transitions. [2024-11-16 16:46:04,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,303 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 669 transitions. [2024-11-16 16:46:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:04,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:04,305 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:04,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 16:46:04,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:04,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash 695375573, now seen corresponding path program 1 times [2024-11-16 16:46:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057908708] [2024-11-16 16:46:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:04,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:04,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057908708] [2024-11-16 16:46:04,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057908708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:04,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:04,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:46:04,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977251810] [2024-11-16 16:46:04,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:04,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:46:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:04,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:46:04,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:46:04,468 INFO L87 Difference]: Start difference. First operand 504 states and 669 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:04,585 INFO L93 Difference]: Finished difference Result 1038 states and 1383 transitions. [2024-11-16 16:46:04,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:46:04,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:04,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:04,587 INFO L225 Difference]: With dead ends: 1038 [2024-11-16 16:46:04,588 INFO L226 Difference]: Without dead ends: 574 [2024-11-16 16:46:04,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:46:04,591 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 179 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:04,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 181 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:46:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-16 16:46:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 443. [2024-11-16 16:46:04,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 387 states have (on average 1.2428940568475453) internal successors, (481), 389 states have internal predecessors, (481), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 16:46:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 581 transitions. [2024-11-16 16:46:04,619 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 581 transitions. Word has length 122 [2024-11-16 16:46:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:04,619 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 581 transitions. [2024-11-16 16:46:04,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 581 transitions. [2024-11-16 16:46:04,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:04,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:04,621 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:04,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 16:46:04,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 723017348, now seen corresponding path program 1 times [2024-11-16 16:46:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981742950] [2024-11-16 16:46:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:04,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:04,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981742950] [2024-11-16 16:46:04,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981742950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:04,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:04,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:46:04,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269289444] [2024-11-16 16:46:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:04,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:46:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:46:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:46:04,974 INFO L87 Difference]: Start difference. First operand 443 states and 581 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:05,238 INFO L93 Difference]: Finished difference Result 751 states and 973 transitions. [2024-11-16 16:46:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 16:46:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:05,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:05,240 INFO L225 Difference]: With dead ends: 751 [2024-11-16 16:46:05,240 INFO L226 Difference]: Without dead ends: 473 [2024-11-16 16:46:05,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-16 16:46:05,241 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 209 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:05,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 324 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:46:05,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-16 16:46:05,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 457. [2024-11-16 16:46:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 395 states have (on average 1.2354430379746835) internal successors, (488), 398 states have internal predecessors, (488), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:46:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 596 transitions. [2024-11-16 16:46:05,271 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 596 transitions. Word has length 122 [2024-11-16 16:46:05,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:05,271 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 596 transitions. [2024-11-16 16:46:05,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 596 transitions. [2024-11-16 16:46:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:05,273 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:05,273 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:05,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 16:46:05,273 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:05,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash -256198323, now seen corresponding path program 1 times [2024-11-16 16:46:05,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:05,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696768065] [2024-11-16 16:46:05,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:05,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:05,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:05,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696768065] [2024-11-16 16:46:05,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696768065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:05,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:46:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866178629] [2024-11-16 16:46:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:05,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:46:05,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:46:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:46:05,530 INFO L87 Difference]: Start difference. First operand 457 states and 596 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:05,674 INFO L93 Difference]: Finished difference Result 846 states and 1094 transitions. [2024-11-16 16:46:05,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:46:05,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:05,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:05,677 INFO L225 Difference]: With dead ends: 846 [2024-11-16 16:46:05,677 INFO L226 Difference]: Without dead ends: 554 [2024-11-16 16:46:05,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:46:05,678 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 92 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:05,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 317 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:46:05,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-16 16:46:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 459. [2024-11-16 16:46:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 397 states have (on average 1.234256926952141) internal successors, (490), 399 states have internal predecessors, (490), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:46:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 598 transitions. [2024-11-16 16:46:05,718 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 598 transitions. Word has length 122 [2024-11-16 16:46:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:05,718 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 598 transitions. [2024-11-16 16:46:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 598 transitions. [2024-11-16 16:46:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:05,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:05,720 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:05,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 16:46:05,720 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:05,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2096303430, now seen corresponding path program 1 times [2024-11-16 16:46:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500579066] [2024-11-16 16:46:05,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:05,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:46:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:46:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:46:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:46:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:46:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:46:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 16:46:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 16:46:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 16:46:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 16:46:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 16:46:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 16:46:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 16:46:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 16:46:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 16:46:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 16:46:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:05,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:46:05,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500579066] [2024-11-16 16:46:05,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500579066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:05,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:05,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:46:05,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632800769] [2024-11-16 16:46:05,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:05,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:46:05,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:46:05,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:46:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:46:05,907 INFO L87 Difference]: Start difference. First operand 459 states and 598 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:06,008 INFO L93 Difference]: Finished difference Result 879 states and 1142 transitions. [2024-11-16 16:46:06,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:46:06,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-16 16:46:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:06,011 INFO L225 Difference]: With dead ends: 879 [2024-11-16 16:46:06,012 INFO L226 Difference]: Without dead ends: 462 [2024-11-16 16:46:06,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:46:06,014 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:06,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 341 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:06,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-16 16:46:06,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2024-11-16 16:46:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 397 states have (on average 1.2292191435768263) internal successors, (488), 399 states have internal predecessors, (488), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:46:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 596 transitions. [2024-11-16 16:46:06,051 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 596 transitions. Word has length 122 [2024-11-16 16:46:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:06,051 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 596 transitions. [2024-11-16 16:46:06,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 596 transitions. [2024-11-16 16:46:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 16:46:06,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:06,053 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:06,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 16:46:06,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:06,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:06,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1354191995, now seen corresponding path program 1 times [2024-11-16 16:46:06,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:46:06,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977023721] [2024-11-16 16:46:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:06,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:46:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:46:06,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:46:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:46:06,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:46:06,171 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:46:06,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:46:06,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 16:46:06,176 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:06,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:46:06,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:46:06 BoogieIcfgContainer [2024-11-16 16:46:06,264 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:46:06,265 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:46:06,265 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:46:06,265 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:46:06,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:45:55" (3/4) ... [2024-11-16 16:46:06,268 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:46:06,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:46:06,269 INFO L158 Benchmark]: Toolchain (without parser) took 11746.76ms. Allocated memory was 216.0MB in the beginning and 534.8MB in the end (delta: 318.8MB). Free memory was 147.0MB in the beginning and 362.4MB in the end (delta: -215.4MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,269 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:46:06,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.86ms. Allocated memory is still 216.0MB. Free memory was 146.7MB in the beginning and 130.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.91ms. Allocated memory is still 216.0MB. Free memory was 130.5MB in the beginning and 126.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,270 INFO L158 Benchmark]: Boogie Preprocessor took 50.69ms. Allocated memory is still 216.0MB. Free memory was 126.8MB in the beginning and 121.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,271 INFO L158 Benchmark]: IcfgBuilder took 425.33ms. Allocated memory is still 216.0MB. Free memory was 121.6MB in the beginning and 164.9MB in the end (delta: -43.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,273 INFO L158 Benchmark]: TraceAbstraction took 10965.59ms. Allocated memory was 216.0MB in the beginning and 534.8MB in the end (delta: 318.8MB). Free memory was 164.9MB in the beginning and 363.4MB in the end (delta: -198.5MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. [2024-11-16 16:46:06,273 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 534.8MB. Free memory is still 362.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:46:06,274 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 71.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.86ms. Allocated memory is still 216.0MB. Free memory was 146.7MB in the beginning and 130.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.91ms. Allocated memory is still 216.0MB. Free memory was 130.5MB in the beginning and 126.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.69ms. Allocated memory is still 216.0MB. Free memory was 126.8MB in the beginning and 121.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 425.33ms. Allocated memory is still 216.0MB. Free memory was 121.6MB in the beginning and 164.9MB in the end (delta: -43.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10965.59ms. Allocated memory was 216.0MB in the beginning and 534.8MB in the end (delta: 318.8MB). Free memory was 164.9MB in the beginning and 363.4MB in the end (delta: -198.5MB). Peak memory consumption was 121.0MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 534.8MB. Free memory is still 362.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2153 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2153 mSDsluCounter, 8838 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6385 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3572 IncrementalHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 2453 mSDtfsCounter, 3572 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=14, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 1364 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2415 NumberOfCodeBlocks, 2415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 6567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 16:46:06,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:46:08,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:46:08,491 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:46:08,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:46:08,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:46:08,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:46:08,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:46:08,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:46:08,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:46:08,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:46:08,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:46:08,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:46:08,529 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:46:08,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:46:08,531 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:46:08,531 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:46:08,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:46:08,531 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:46:08,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:46:08,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:46:08,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:46:08,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:46:08,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:46:08,535 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:46:08,535 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:46:08,535 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:46:08,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:46:08,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:46:08,536 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:46:08,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:46:08,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:46:08,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:46:08,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:46:08,537 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:46:08,537 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:46:08,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:46:08,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:46:08,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:46:08,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:46:08,538 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-11-16 16:46:08,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:46:08,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:46:08,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:46:08,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:46:08,824 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:46:08,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:46:10,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:46:10,418 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:46:10,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:46:10,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a70293af/42a45a7daa4444abbdb5ff57e15f1069/FLAG32f50600d [2024-11-16 16:46:10,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a70293af/42a45a7daa4444abbdb5ff57e15f1069 [2024-11-16 16:46:10,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:46:10,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:46:10,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:46:10,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:46:10,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:46:10,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:46:10" (1/1) ... [2024-11-16 16:46:10,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d0cc0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:10, skipping insertion in model container [2024-11-16 16:46:10,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:46:10" (1/1) ... [2024-11-16 16:46:10,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:46:10,930 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-16 16:46:10,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:46:10,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:46:10,995 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-16 16:46:11,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:46:11,040 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:46:11,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11 WrapperNode [2024-11-16 16:46:11,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:46:11,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:46:11,042 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:46:11,042 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:46:11,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,057 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,076 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-16 16:46:11,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:46:11,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:46:11,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:46:11,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:46:11,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,113 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 16:46:11,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,127 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,128 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:46:11,135 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:46:11,135 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:46:11,135 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:46:11,136 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (1/1) ... [2024-11-16 16:46:11,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:46:11,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:46:11,238 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-16 16:46:11,244 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-16 16:46:11,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:46:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:46:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:46:11,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:46:11,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:46:11,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:46:11,340 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:46:11,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:46:16,364 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-16 16:46:16,365 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:46:16,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:46:16,375 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:46:16,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:46:16 BoogieIcfgContainer [2024-11-16 16:46:16,376 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:46:16,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:46:16,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:46:16,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:46:16,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:46:10" (1/3) ... [2024-11-16 16:46:16,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c035c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:46:16, skipping insertion in model container [2024-11-16 16:46:16,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:46:11" (2/3) ... [2024-11-16 16:46:16,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c035c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:46:16, skipping insertion in model container [2024-11-16 16:46:16,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:46:16" (3/3) ... [2024-11-16 16:46:16,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-16 16:46:16,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:46:16,395 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:46:16,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:46:16,449 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;@5356b770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:46:16,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:46:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:46:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:46:16,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:16,467 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:16,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:16,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1462991310, now seen corresponding path program 1 times [2024-11-16 16:46:16,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:46:16,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904931984] [2024-11-16 16:46:16,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:16,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:16,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:46:16,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:46:16,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 16:46:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:16,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:46:16,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:46:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-16 16:46:16,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:46:16,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:46:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904931984] [2024-11-16 16:46:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904931984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:46:16,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369087308] [2024-11-16 16:46:16,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:16,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:46:16,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:46:16,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:46:16,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:46:16,936 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:46:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:16,964 INFO L93 Difference]: Finished difference Result 118 states and 188 transitions. [2024-11-16 16:46:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:46:16,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2024-11-16 16:46:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:16,971 INFO L225 Difference]: With dead ends: 118 [2024-11-16 16:46:16,972 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 16:46:16,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:46:16,979 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:16,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:46:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 16:46:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 16:46:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 16:46:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-16 16:46:17,020 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 112 [2024-11-16 16:46:17,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:17,021 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-16 16:46:17,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 16:46:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-16 16:46:17,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:46:17,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:17,023 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:17,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 16:46:17,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:17,225 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:17,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash 419618100, now seen corresponding path program 1 times [2024-11-16 16:46:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:46:17,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691190774] [2024-11-16 16:46:17,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:17,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:17,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:46:17,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:46:17,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 16:46:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:17,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:46:17,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:46:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:18,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:46:18,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:46:18,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691190774] [2024-11-16 16:46:18,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691190774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:18,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:18,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:46:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486124870] [2024-11-16 16:46:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:18,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:46:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:46:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:46:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:46:18,740 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:22,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:46:23,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:46:23,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:23,752 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-11-16 16:46:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:46:23,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-16 16:46:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:23,779 INFO L225 Difference]: With dead ends: 164 [2024-11-16 16:46:23,779 INFO L226 Difference]: Without dead ends: 111 [2024-11-16 16:46:23,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:46:23,780 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:23,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 252 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-16 16:46:23,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-16 16:46:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2024-11-16 16:46:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:46:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-11-16 16:46:23,798 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 112 [2024-11-16 16:46:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:23,799 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-11-16 16:46:23,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-11-16 16:46:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:46:23,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:23,800 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:23,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 16:46:24,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:24,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:24,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:24,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1927169909, now seen corresponding path program 1 times [2024-11-16 16:46:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:46:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668239055] [2024-11-16 16:46:24,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:24,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:46:24,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:46:24,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 16:46:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:24,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:46:24,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:46:24,354 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 16:46:24,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:46:24,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:46:24,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668239055] [2024-11-16 16:46:24,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668239055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:46:24,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:46:24,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:46:24,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969892262] [2024-11-16 16:46:24,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:46:24,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:46:24,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:46:24,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:46:24,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:46:24,357 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:26,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:46:26,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:46:26,221 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-16 16:46:26,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:46:26,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-16 16:46:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:46:26,228 INFO L225 Difference]: With dead ends: 162 [2024-11-16 16:46:26,228 INFO L226 Difference]: Without dead ends: 109 [2024-11-16 16:46:26,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 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-16 16:46:26,229 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 16:46:26,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 16:46:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-16 16:46:26,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-16 16:46:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 16:46:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-16 16:46:26,244 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 112 [2024-11-16 16:46:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:46:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-16 16:46:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 16:46:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-16 16:46:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 16:46:26,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:46:26,247 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:46:26,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 16:46:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:26,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:46:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:46:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1762849621, now seen corresponding path program 1 times [2024-11-16 16:46:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:46:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617552126] [2024-11-16 16:46:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:46:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 16:46:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:46:26,454 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 16:46:26,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 16:46:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:46:26,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-16 16:46:26,773 INFO L278 TraceCheckSpWp]: Computing forward predicates...