./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:45:59,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:45:59,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:45:59,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:45:59,333 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:45:59,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:45:59,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:45:59,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:45:59,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:45:59,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:45:59,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:45:59,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:45:59,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:45:59,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:45:59,354 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:45:59,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:45:59,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:45:59,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:45:59,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:45:59,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:45:59,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:45:59,358 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:45:59,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:45:59,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:45:59,359 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:45:59,359 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:45:59,359 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:45:59,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:45:59,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:45:59,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:45:59,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:45:59,361 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-10 03:45:59,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:45:59,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:45:59,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:45:59,593 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:45:59,594 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:45:59,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:00,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:46:00,968 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:46:00,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:00,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f49d606/ec399a43befa49c1b4be2a3d25ceade6/FLAGb05d53059 [2024-11-10 03:46:01,373 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71f49d606/ec399a43befa49c1b4be2a3d25ceade6 [2024-11-10 03:46:01,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:46:01,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:46:01,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:01,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:46:01,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:46:01,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,384 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b609ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01, skipping insertion in model container [2024-11-10 03:46:01,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:46:01,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-10 03:46:01,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:01,625 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:46:01,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-10 03:46:01,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:01,685 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:46:01,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01 WrapperNode [2024-11-10 03:46:01,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:01,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:01,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:46:01,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:46:01,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,702 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,729 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-10 03:46:01,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:01,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:46:01,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:46:01,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:46:01,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:46:01,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:46:01,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:46:01,779 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:46:01,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:46:01,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (1/1) ... [2024-11-10 03:46:01,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:01,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:46:01,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:46:01,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:46:01,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:46:01,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:46:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:46:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:46:01,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:46:01,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:46:01,939 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:46:01,946 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:46:02,235 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 03:46:02,262 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 03:46:02,263 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:46:02,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:46:02,282 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:46:02,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:02 BoogieIcfgContainer [2024-11-10 03:46:02,282 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:46:02,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:46:02,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:46:02,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:46:02,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:46:01" (1/3) ... [2024-11-10 03:46:02,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@829393a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:02, skipping insertion in model container [2024-11-10 03:46:02,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:01" (2/3) ... [2024-11-10 03:46:02,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@829393a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:02, skipping insertion in model container [2024-11-10 03:46:02,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:02" (3/3) ... [2024-11-10 03:46:02,290 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:02,303 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:46:02,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:46:02,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:46:02,361 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;@1cddb524, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:46:02,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:46:02,368 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-10 03:46:02,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:46:02,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:02,379 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-10 03:46:02,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:02,385 INFO L85 PathProgramCache]: Analyzing trace with hash -592616479, now seen corresponding path program 1 times [2024-11-10 03:46:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151551588] [2024-11-10 03:46:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:02,733 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-10 03:46:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:02,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151551588] [2024-11-10 03:46:02,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151551588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:02,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:02,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:46:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949508778] [2024-11-10 03:46:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:02,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:46:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:02,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:46:02,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:46:02,764 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-10 03:46:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:02,798 INFO L93 Difference]: Finished difference Result 142 states and 227 transitions. [2024-11-10 03:46:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:46:02,801 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-10 03:46:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:02,808 INFO L225 Difference]: With dead ends: 142 [2024-11-10 03:46:02,809 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 03:46:02,811 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-10 03:46:02,816 INFO L432 NwaCegarLoop]: 97 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, 97 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-10 03:46:02,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:46:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 03:46:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 03:46:02,848 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-10 03:46:02,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-11-10 03:46:02,850 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 118 [2024-11-10 03:46:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-11-10 03:46:02,851 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-10 03:46:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-11-10 03:46:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:46:02,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:02,854 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-10 03:46:02,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:46:02,854 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -471719225, now seen corresponding path program 1 times [2024-11-10 03:46:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930706181] [2024-11-10 03:46:02,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:02,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,061 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-10 03:46:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930706181] [2024-11-10 03:46:03,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930706181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:03,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:03,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985486130] [2024-11-10 03:46:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:03,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:03,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:03,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:03,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:03,066 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-10 03:46:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:03,128 INFO L93 Difference]: Finished difference Result 169 states and 244 transitions. [2024-11-10 03:46:03,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:03,129 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-10 03:46:03,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:03,130 INFO L225 Difference]: With dead ends: 169 [2024-11-10 03:46:03,132 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 03:46:03,133 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-10 03:46:03,133 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.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:03,134 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.0s Time] [2024-11-10 03:46:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 03:46:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-11-10 03:46:03,142 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-10 03:46:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-10 03:46:03,143 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 118 [2024-11-10 03:46:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:03,144 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-10 03:46:03,144 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-10 03:46:03,144 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-10 03:46:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 03:46:03,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:03,147 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-10 03:46:03,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:46:03,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1981703847, now seen corresponding path program 1 times [2024-11-10 03:46:03,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528457790] [2024-11-10 03:46:03,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:03,643 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-10 03:46:03,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:03,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528457790] [2024-11-10 03:46:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528457790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:03,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503115590] [2024-11-10 03:46:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:03,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:03,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:03,649 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-10 03:46:03,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:03,950 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-11-10 03:46:03,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:03,951 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-10 03:46:03,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:03,955 INFO L225 Difference]: With dead ends: 270 [2024-11-10 03:46:03,955 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 03:46:03,955 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-10 03:46:03,958 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-10 03:46:03,959 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-10 03:46:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 03:46:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 104. [2024-11-10 03:46:03,978 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-10 03:46:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-10 03:46:03,982 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 118 [2024-11-10 03:46:03,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:03,983 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-10 03:46:03,983 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-10 03:46:03,983 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-10 03:46:03,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 03:46:03,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:03,986 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-10 03:46:03,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:46:03,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:03,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:03,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1830585519, now seen corresponding path program 1 times [2024-11-10 03:46:03,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:03,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115014895] [2024-11-10 03:46:03,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:04,432 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-10 03:46:04,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:04,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115014895] [2024-11-10 03:46:04,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115014895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:04,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:04,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:46:04,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654832260] [2024-11-10 03:46:04,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:04,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:46:04,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:04,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:46:04,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:46:04,436 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-10 03:46:04,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:04,698 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2024-11-10 03:46:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:46:04,699 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-10 03:46:04,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:04,700 INFO L225 Difference]: With dead ends: 269 [2024-11-10 03:46:04,700 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 03:46:04,701 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-10 03:46:04,701 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-10 03:46:04,702 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-10 03:46:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 03:46:04,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2024-11-10 03:46:04,710 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-10 03:46:04,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-10 03:46:04,711 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 119 [2024-11-10 03:46:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:04,712 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-10 03:46:04,712 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-10 03:46:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-10 03:46:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 03:46:04,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:04,713 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-10 03:46:04,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:46:04,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:04,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:04,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1483513283, now seen corresponding path program 1 times [2024-11-10 03:46:04,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:04,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408878905] [2024-11-10 03:46:04,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:05,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:05,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:05,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,138 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-10 03:46:05,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408878905] [2024-11-10 03:46:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408878905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:46:05,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504972182] [2024-11-10 03:46:05,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:46:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:46:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:46:05,142 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-10 03:46:05,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:05,380 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2024-11-10 03:46:05,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:46:05,380 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-10 03:46:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:05,382 INFO L225 Difference]: With dead ends: 290 [2024-11-10 03:46:05,382 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 03:46:05,382 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-10 03:46:05,383 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-10 03:46:05,386 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-10 03:46:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 03:46:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2024-11-10 03:46:05,398 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-10 03:46:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-10 03:46:05,399 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 120 [2024-11-10 03:46:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:05,402 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-10 03:46:05,402 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-10 03:46:05,402 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-10 03:46:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 03:46:05,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:05,404 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-10 03:46:05,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:46:05,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:05,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2075905340, now seen corresponding path program 1 times [2024-11-10 03:46:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42902201] [2024-11-10 03:46:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:05,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:06,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:06,020 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-10 03:46:06,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42902201] [2024-11-10 03:46:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42902201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:06,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:46:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983590582] [2024-11-10 03:46:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:06,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:46:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:46:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:46:06,021 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-10 03:46:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:06,601 INFO L93 Difference]: Finished difference Result 341 states and 486 transitions. [2024-11-10 03:46:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:46:06,602 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-10 03:46:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:06,603 INFO L225 Difference]: With dead ends: 341 [2024-11-10 03:46:06,603 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 03:46:06,604 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-10 03:46:06,604 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 172 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-10 03:46:06,604 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-10 03:46:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 03:46:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2024-11-10 03:46:06,610 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-10 03:46:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-10 03:46:06,610 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 120 [2024-11-10 03:46:06,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:06,611 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-10 03:46:06,611 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-10 03:46:06,611 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-10 03:46:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:06,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:06,612 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-10 03:46:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:46:06,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash 355188204, now seen corresponding path program 1 times [2024-11-10 03:46:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858591500] [2024-11-10 03:46:06,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:07,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:07,230 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-10 03:46:07,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:07,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858591500] [2024-11-10 03:46:07,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858591500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:07,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:07,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:46:07,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737771306] [2024-11-10 03:46:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:07,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:46:07,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:07,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:46:07,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:46:07,232 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-10 03:46:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:07,727 INFO L93 Difference]: Finished difference Result 354 states and 486 transitions. [2024-11-10 03:46:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:46:07,728 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-10 03:46:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:07,730 INFO L225 Difference]: With dead ends: 354 [2024-11-10 03:46:07,730 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 03:46:07,730 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-10 03:46:07,731 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 211 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:07,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1065 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:46:07,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 03:46:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 137. [2024-11-10 03:46:07,744 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-10 03:46:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2024-11-10 03:46:07,745 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 121 [2024-11-10 03:46:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:07,745 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2024-11-10 03:46:07,745 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-10 03:46:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2024-11-10 03:46:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:07,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:07,746 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-10 03:46:07,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:46:07,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:07,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:07,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1100131932, now seen corresponding path program 1 times [2024-11-10 03:46:07,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980474984] [2024-11-10 03:46:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:08,636 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-10 03:46:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:08,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980474984] [2024-11-10 03:46:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980474984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:08,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 03:46:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026646268] [2024-11-10 03:46:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:46:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:46:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:46:08,638 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-10 03:46:09,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:09,149 INFO L93 Difference]: Finished difference Result 467 states and 627 transitions. [2024-11-10 03:46:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 03:46:09,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-10 03:46:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:09,151 INFO L225 Difference]: With dead ends: 467 [2024-11-10 03:46:09,151 INFO L226 Difference]: Without dead ends: 333 [2024-11-10 03:46:09,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-11-10 03:46:09,152 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 272 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:09,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 748 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:46:09,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-10 03:46:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 249. [2024-11-10 03:46:09,165 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-10 03:46:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2024-11-10 03:46:09,166 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 121 [2024-11-10 03:46:09,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:09,166 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2024-11-10 03:46:09,166 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-10 03:46:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2024-11-10 03:46:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:09,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:09,167 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-10 03:46:09,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:46:09,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:09,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash -678881924, now seen corresponding path program 1 times [2024-11-10 03:46:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486291262] [2024-11-10 03:46:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,235 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-10 03:46:09,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:09,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486291262] [2024-11-10 03:46:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486291262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560196476] [2024-11-10 03:46:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:09,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:09,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:09,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:09,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:09,236 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-10 03:46:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:09,273 INFO L93 Difference]: Finished difference Result 657 states and 898 transitions. [2024-11-10 03:46:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:09,273 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-10 03:46:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:09,276 INFO L225 Difference]: With dead ends: 657 [2024-11-10 03:46:09,299 INFO L226 Difference]: Without dead ends: 411 [2024-11-10 03:46:09,299 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-10 03:46:09,300 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-10 03:46:09,300 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-10 03:46:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-10 03:46:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 283. [2024-11-10 03:46:09,312 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-10 03:46:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 383 transitions. [2024-11-10 03:46:09,314 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 383 transitions. Word has length 121 [2024-11-10 03:46:09,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:09,314 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 383 transitions. [2024-11-10 03:46:09,314 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-10 03:46:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 383 transitions. [2024-11-10 03:46:09,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:09,315 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-10 03:46:09,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:46:09,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:09,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:09,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1592484815, now seen corresponding path program 1 times [2024-11-10 03:46:09,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:09,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184608733] [2024-11-10 03:46:09,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:09,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:09,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,376 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-10 03:46:09,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:09,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184608733] [2024-11-10 03:46:09,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184608733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:09,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:09,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:09,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311566357] [2024-11-10 03:46:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:09,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:09,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:09,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:09,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:09,378 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-10 03:46:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:09,413 INFO L93 Difference]: Finished difference Result 684 states and 919 transitions. [2024-11-10 03:46:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:09,413 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-10 03:46:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:09,416 INFO L225 Difference]: With dead ends: 684 [2024-11-10 03:46:09,416 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 03:46:09,417 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-10 03:46:09,417 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-10 03:46:09,418 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-10 03:46:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 03:46:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 335. [2024-11-10 03:46:09,427 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-10 03:46:09,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2024-11-10 03:46:09,429 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 121 [2024-11-10 03:46:09,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:09,429 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2024-11-10 03:46:09,429 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-10 03:46:09,429 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2024-11-10 03:46:09,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:09,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:09,430 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-10 03:46:09,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 03:46:09,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:09,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1013486799, now seen corresponding path program 1 times [2024-11-10 03:46:09,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:09,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973239225] [2024-11-10 03:46:09,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:09,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:09,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,500 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-10 03:46:09,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:09,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973239225] [2024-11-10 03:46:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973239225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771915566] [2024-11-10 03:46:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:09,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:09,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:09,501 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-10 03:46:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:09,538 INFO L93 Difference]: Finished difference Result 734 states and 978 transitions. [2024-11-10 03:46:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:09,538 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-10 03:46:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:09,540 INFO L225 Difference]: With dead ends: 734 [2024-11-10 03:46:09,540 INFO L226 Difference]: Without dead ends: 402 [2024-11-10 03:46:09,540 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-10 03:46:09,541 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-10 03:46:09,541 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-10 03:46:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-10 03:46:09,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 335. [2024-11-10 03:46:09,554 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-10 03:46:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 446 transitions. [2024-11-10 03:46:09,555 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 446 transitions. Word has length 121 [2024-11-10 03:46:09,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:09,555 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 446 transitions. [2024-11-10 03:46:09,556 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-10 03:46:09,556 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 446 transitions. [2024-11-10 03:46:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 03:46:09,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:09,557 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-10 03:46:09,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:46:09,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:09,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:09,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1033125179, now seen corresponding path program 1 times [2024-11-10 03:46:09,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:09,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100968105] [2024-11-10 03:46:09,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:09,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:09,765 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-10 03:46:09,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:09,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100968105] [2024-11-10 03:46:09,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100968105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:09,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034669235] [2024-11-10 03:46:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:09,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:09,767 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-10 03:46:09,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:09,978 INFO L93 Difference]: Finished difference Result 854 states and 1148 transitions. [2024-11-10 03:46:09,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 03:46:09,978 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-10 03:46:09,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:09,981 INFO L225 Difference]: With dead ends: 854 [2024-11-10 03:46:09,981 INFO L226 Difference]: Without dead ends: 522 [2024-11-10 03:46:09,982 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-10 03:46:09,982 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-10 03:46:09,982 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-10 03:46:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-10 03:46:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 482. [2024-11-10 03:46:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 444 states have (on average 1.2972972972972974) internal successors, (576), 445 states have internal predecessors, (576), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:46:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 644 transitions. [2024-11-10 03:46:09,996 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 644 transitions. Word has length 121 [2024-11-10 03:46:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:09,997 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 644 transitions. [2024-11-10 03:46:09,997 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-10 03:46:09,997 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 644 transitions. [2024-11-10 03:46:09,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:09,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:09,998 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-10 03:46:09,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 03:46:09,998 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:09,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 768441574, now seen corresponding path program 1 times [2024-11-10 03:46:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948251142] [2024-11-10 03:46:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:10,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:10,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,299 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-10 03:46:10,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:10,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948251142] [2024-11-10 03:46:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948251142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 03:46:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596095825] [2024-11-10 03:46:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:10,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 03:46:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 03:46:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 03:46:10,301 INFO L87 Difference]: Start difference. First operand 482 states and 644 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-10 03:46:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:10,494 INFO L93 Difference]: Finished difference Result 989 states and 1298 transitions. [2024-11-10 03:46:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:46:10,494 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-10 03:46:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:10,497 INFO L225 Difference]: With dead ends: 989 [2024-11-10 03:46:10,497 INFO L226 Difference]: Without dead ends: 657 [2024-11-10 03:46:10,497 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-10 03:46:10,498 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 60 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:10,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 656 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:46:10,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-10 03:46:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 488. [2024-11-10 03:46:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 450 states have (on average 1.2977777777777777) internal successors, (584), 451 states have internal predecessors, (584), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:46:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 652 transitions. [2024-11-10 03:46:10,517 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 652 transitions. Word has length 122 [2024-11-10 03:46:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:10,517 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 652 transitions. [2024-11-10 03:46:10,517 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-10 03:46:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 652 transitions. [2024-11-10 03:46:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:10,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:10,519 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-10 03:46:10,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 03:46:10,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:10,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:10,520 INFO L85 PathProgramCache]: Analyzing trace with hash -121454523, now seen corresponding path program 1 times [2024-11-10 03:46:10,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:10,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462151278] [2024-11-10 03:46:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:10,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:10,971 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-10 03:46:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462151278] [2024-11-10 03:46:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462151278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:10,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:46:10,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138005810] [2024-11-10 03:46:10,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:46:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:10,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:46:10,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:46:10,973 INFO L87 Difference]: Start difference. First operand 488 states and 652 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-10 03:46:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:11,235 INFO L93 Difference]: Finished difference Result 891 states and 1181 transitions. [2024-11-10 03:46:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:46:11,236 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-10 03:46:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:11,238 INFO L225 Difference]: With dead ends: 891 [2024-11-10 03:46:11,238 INFO L226 Difference]: Without dead ends: 553 [2024-11-10 03:46:11,239 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-10 03:46:11,239 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 121 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:11,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 501 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:46:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-10 03:46:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 496. [2024-11-10 03:46:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 458 states have (on average 1.3013100436681222) internal successors, (596), 459 states have internal predecessors, (596), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:46:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 664 transitions. [2024-11-10 03:46:11,256 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 664 transitions. Word has length 122 [2024-11-10 03:46:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:11,256 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 664 transitions. [2024-11-10 03:46:11,256 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-10 03:46:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 664 transitions. [2024-11-10 03:46:11,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:11,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:11,257 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-10 03:46:11,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 03:46:11,257 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash 10230261, now seen corresponding path program 1 times [2024-11-10 03:46:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:11,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778509833] [2024-11-10 03:46:11,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,314 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-10 03:46:11,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:11,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778509833] [2024-11-10 03:46:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778509833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:11,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68119117] [2024-11-10 03:46:11,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:11,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:11,316 INFO L87 Difference]: Start difference. First operand 496 states and 664 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-10 03:46:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:11,358 INFO L93 Difference]: Finished difference Result 1122 states and 1502 transitions. [2024-11-10 03:46:11,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:11,359 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-10 03:46:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:11,362 INFO L225 Difference]: With dead ends: 1122 [2024-11-10 03:46:11,362 INFO L226 Difference]: Without dead ends: 629 [2024-11-10 03:46:11,364 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-10 03:46:11,364 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-10 03:46:11,364 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-10 03:46:11,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-10 03:46:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 467. [2024-11-10 03:46:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 429 states have (on average 1.2820512820512822) internal successors, (550), 430 states have internal predecessors, (550), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:46:11,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 618 transitions. [2024-11-10 03:46:11,384 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 618 transitions. Word has length 122 [2024-11-10 03:46:11,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:11,384 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 618 transitions. [2024-11-10 03:46:11,385 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-10 03:46:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 618 transitions. [2024-11-10 03:46:11,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:11,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:11,387 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-10 03:46:11,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 03:46:11,387 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:11,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:11,387 INFO L85 PathProgramCache]: Analyzing trace with hash 695375573, now seen corresponding path program 1 times [2024-11-10 03:46:11,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:11,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329205267] [2024-11-10 03:46:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:11,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:11,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:11,522 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-10 03:46:11,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:11,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329205267] [2024-11-10 03:46:11,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329205267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:11,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:11,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:46:11,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479097366] [2024-11-10 03:46:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:11,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:46:11,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:11,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:46:11,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:46:11,525 INFO L87 Difference]: Start difference. First operand 467 states and 618 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-10 03:46:11,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:11,632 INFO L93 Difference]: Finished difference Result 1001 states and 1332 transitions. [2024-11-10 03:46:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:46:11,632 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-10 03:46:11,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:11,635 INFO L225 Difference]: With dead ends: 1001 [2024-11-10 03:46:11,635 INFO L226 Difference]: Without dead ends: 537 [2024-11-10 03:46:11,636 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-10 03:46:11,636 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-10 03:46:11,636 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-10 03:46:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-10 03:46:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 406. [2024-11-10 03:46:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 368 states have (on average 1.2554347826086956) internal successors, (462), 369 states have internal predecessors, (462), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:46:11,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 530 transitions. [2024-11-10 03:46:11,658 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 530 transitions. Word has length 122 [2024-11-10 03:46:11,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:11,658 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 530 transitions. [2024-11-10 03:46:11,658 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-10 03:46:11,658 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 530 transitions. [2024-11-10 03:46:11,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:11,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:11,659 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-10 03:46:11,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 03:46:11,660 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash 723017348, now seen corresponding path program 1 times [2024-11-10 03:46:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479498211] [2024-11-10 03:46:11,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,040 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-10 03:46:12,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:12,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479498211] [2024-11-10 03:46:12,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479498211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:12,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:46:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363781789] [2024-11-10 03:46:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:12,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:46:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:12,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:46:12,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:46:12,041 INFO L87 Difference]: Start difference. First operand 406 states and 530 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-10 03:46:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:12,302 INFO L93 Difference]: Finished difference Result 724 states and 933 transitions. [2024-11-10 03:46:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:46:12,303 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-10 03:46:12,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:12,305 INFO L225 Difference]: With dead ends: 724 [2024-11-10 03:46:12,305 INFO L226 Difference]: Without dead ends: 446 [2024-11-10 03:46:12,306 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-10 03:46:12,306 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 155 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 445 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:46:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-10 03:46:12,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 429. [2024-11-10 03:46:12,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 382 states have (on average 1.243455497382199) internal successors, (475), 385 states have internal predecessors, (475), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 03:46:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 555 transitions. [2024-11-10 03:46:12,342 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 555 transitions. Word has length 122 [2024-11-10 03:46:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:12,342 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 555 transitions. [2024-11-10 03:46:12,343 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-10 03:46:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 555 transitions. [2024-11-10 03:46:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:12,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:12,345 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-10 03:46:12,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 03:46:12,345 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:12,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:12,345 INFO L85 PathProgramCache]: Analyzing trace with hash -256198323, now seen corresponding path program 1 times [2024-11-10 03:46:12,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091466828] [2024-11-10 03:46:12,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:12,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,617 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-10 03:46:12,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:12,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091466828] [2024-11-10 03:46:12,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091466828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:12,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:12,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396810377] [2024-11-10 03:46:12,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:12,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:12,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:12,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:12,618 INFO L87 Difference]: Start difference. First operand 429 states and 555 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-10 03:46:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:12,758 INFO L93 Difference]: Finished difference Result 846 states and 1094 transitions. [2024-11-10 03:46:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:12,759 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-10 03:46:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:12,761 INFO L225 Difference]: With dead ends: 846 [2024-11-10 03:46:12,761 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 03:46:12,762 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-10 03:46:12,762 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-10 03:46:12,762 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-10 03:46:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 03:46:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 459. [2024-11-10 03:46:12,792 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-10 03:46:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 598 transitions. [2024-11-10 03:46:12,794 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 598 transitions. Word has length 122 [2024-11-10 03:46:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:12,794 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 598 transitions. [2024-11-10 03:46:12,794 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-10 03:46:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 598 transitions. [2024-11-10 03:46:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:12,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:12,795 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-10 03:46:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 03:46:12,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2096303430, now seen corresponding path program 1 times [2024-11-10 03:46:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795298127] [2024-11-10 03:46:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:46:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:46:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:46:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:46:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:46:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:46:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:46:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:46:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:46:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 03:46:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 03:46:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 03:46:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 03:46:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 03:46:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 03:46:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 03:46:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:12,936 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-10 03:46:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:46:12,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795298127] [2024-11-10 03:46:12,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795298127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:12,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:12,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:46:12,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373251682] [2024-11-10 03:46:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:12,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:46:12,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:12,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:12,939 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-10 03:46:13,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:13,034 INFO L93 Difference]: Finished difference Result 879 states and 1142 transitions. [2024-11-10 03:46:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:13,035 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-10 03:46:13,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:13,037 INFO L225 Difference]: With dead ends: 879 [2024-11-10 03:46:13,037 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 03:46:13,038 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-10 03:46:13,040 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-10 03:46:13,040 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-10 03:46:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 03:46:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2024-11-10 03:46:13,078 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-10 03:46:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 596 transitions. [2024-11-10 03:46:13,080 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 596 transitions. Word has length 122 [2024-11-10 03:46:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 596 transitions. [2024-11-10 03:46:13,081 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-10 03:46:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 596 transitions. [2024-11-10 03:46:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 03:46:13,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:13,082 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-10 03:46:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 03:46:13,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:13,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1354191995, now seen corresponding path program 1 times [2024-11-10 03:46:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:46:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797755410] [2024-11-10 03:46:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:46:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:46:13,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:46:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:46:13,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:46:13,187 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:46:13,188 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:46:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 03:46:13,192 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-10 03:46:13,271 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:46:13,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:46:13 BoogieIcfgContainer [2024-11-10 03:46:13,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:46:13,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:46:13,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:46:13,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:46:13,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:02" (3/4) ... [2024-11-10 03:46:13,276 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:46:13,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:46:13,277 INFO L158 Benchmark]: Toolchain (without parser) took 11899.31ms. Allocated memory was 169.9MB in the beginning and 469.8MB in the end (delta: 299.9MB). Free memory was 138.9MB in the beginning and 326.6MB in the end (delta: -187.7MB). Peak memory consumption was 111.6MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,277 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.24ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 122.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.21ms. Allocated memory is still 169.9MB. Free memory was 122.6MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: Boogie Preprocessor took 47.69ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 114.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: IcfgBuilder took 504.03ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 121.4MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: TraceAbstraction took 10988.80ms. Allocated memory was 169.9MB in the beginning and 469.8MB in the end (delta: 299.9MB). Free memory was 121.4MB in the beginning and 327.6MB in the end (delta: -206.2MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-11-10 03:46:13,278 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 469.8MB. Free memory was 327.6MB in the beginning and 326.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:46:13,279 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.10ms. Allocated memory is still 109.1MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.24ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 122.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.21ms. Allocated memory is still 169.9MB. Free memory was 122.6MB in the beginning and 119.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.69ms. Allocated memory is still 169.9MB. Free memory was 119.4MB in the beginning and 114.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 504.03ms. Allocated memory is still 169.9MB. Free memory was 114.2MB in the beginning and 121.4MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10988.80ms. Allocated memory was 169.9MB in the beginning and 469.8MB in the end (delta: 299.9MB). Free memory was 121.4MB in the beginning and 327.6MB in the end (delta: -206.2MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 469.8MB. Free memory was 327.6MB in the beginning and 326.6MB in the end (delta: 1.0MB). 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] COND TRUE 1 [L131] 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] [L131] RET updateLastVariables() [L132] 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateVariables() [L133] 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=10, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] [L133] RET step() [L134] 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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)) ; [L134] RET, EXPR property() [L134] 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, 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=0, var_1_16=0, var_1_17=505, var_1_1=252, var_1_22=505, var_1_24=0, var_1_26=126, var_1_27=63, var_1_28=63, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2174 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2174 mSDsluCounter, 8723 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6265 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3410 IncrementalHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 2458 mSDtfsCounter, 3410 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred 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, 1398 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2415 NumberOfCodeBlocks, 2415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 6674 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-10 03:46:13,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercode_fillercodesize_normal_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 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:46:15,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:46:15,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:46:15,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:46:15,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:46:15,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:46:15,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:46:15,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:46:15,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:46:15,256 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:46:15,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:46:15,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:46:15,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:46:15,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:46:15,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:46:15,258 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:46:15,258 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:46:15,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:46:15,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:46:15,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:46:15,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:46:15,261 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:46:15,261 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:46:15,261 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:46:15,262 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:46:15,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:46:15,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:46:15,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:46:15,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:46:15,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:15,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:46:15,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:46:15,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:46:15,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:46:15,265 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 -> 22049259aa90ec31463fad29fa04047c315294147ab56d7684d575018f4c12a6 [2024-11-10 03:46:15,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:46:15,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:46:15,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:46:15,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:46:15,524 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:46:15,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:16,748 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:46:16,956 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:46:16,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:16,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0b80f8f/ab9c74f743304efd84dd7c5a835d4a26/FLAG61b96aec8 [2024-11-10 03:46:16,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e0b80f8f/ab9c74f743304efd84dd7c5a835d4a26 [2024-11-10 03:46:16,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:46:16,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:46:16,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:16,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:46:16,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:46:16,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:16" (1/1) ... [2024-11-10 03:46:16,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d847897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:16, skipping insertion in model container [2024-11-10 03:46:16,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:46:16" (1/1) ... [2024-11-10 03:46:17,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:46:17,146 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-10 03:46:17,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:17,219 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:46:17,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-63.i[913,926] [2024-11-10 03:46:17,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:46:17,278 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:46:17,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17 WrapperNode [2024-11-10 03:46:17,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:46:17,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:17,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:46:17,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:46:17,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,297 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,334 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-11-10 03:46:17,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:46:17,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:46:17,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:46:17,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:46:17,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:46:17,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:46:17,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:46:17,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:46:17,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:46:17,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (1/1) ... [2024-11-10 03:46:17,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:46:17,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:46:17,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:46:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:46:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:46:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:46:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:46:17,472 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:46:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:46:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:46:17,550 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:46:17,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:46:22,158 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 03:46:22,159 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:46:22,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:46:22,169 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:46:22,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:22 BoogieIcfgContainer [2024-11-10 03:46:22,170 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:46:22,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:46:22,174 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:46:22,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:46:22,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:46:16" (1/3) ... [2024-11-10 03:46:22,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1b1847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:22, skipping insertion in model container [2024-11-10 03:46:22,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:46:17" (2/3) ... [2024-11-10 03:46:22,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1b1847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:46:22, skipping insertion in model container [2024-11-10 03:46:22,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:46:22" (3/3) ... [2024-11-10 03:46:22,178 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-63.i [2024-11-10 03:46:22,191 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:46:22,191 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:46:22,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:46:22,242 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;@31c84e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:46:22,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:46:22,246 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-10 03:46:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:46:22,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:22,255 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-10 03:46:22,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:22,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1462991310, now seen corresponding path program 1 times [2024-11-10 03:46:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:46:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [243468673] [2024-11-10 03:46:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:22,269 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-10 03:46:22,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:46:22,270 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-10 03:46:22,271 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-10 03:46:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:22,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:46:22,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:46:22,631 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-10 03:46:22,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:46:22,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:46:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [243468673] [2024-11-10 03:46:22,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [243468673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:22,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:22,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:46:22,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580698261] [2024-11-10 03:46:22,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:22,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:46:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:46:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:46:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:46:22,662 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-10 03:46:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:22,682 INFO L93 Difference]: Finished difference Result 114 states and 185 transitions. [2024-11-10 03:46:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:46:22,684 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-10 03:46:22,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:22,689 INFO L225 Difference]: With dead ends: 114 [2024-11-10 03:46:22,690 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 03:46:22,692 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-10 03:46:22,694 INFO L432 NwaCegarLoop]: 80 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, 80 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-10 03:46:22,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:46:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 03:46:22,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 03:46:22,722 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-10 03:46:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-10 03:46:22,724 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 112 [2024-11-10 03:46:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:22,725 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-10 03:46:22,725 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-10 03:46:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-10 03:46:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:46:22,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:22,727 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-10 03:46:22,738 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-10 03:46:22,928 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-10 03:46:22,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:22,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:22,929 INFO L85 PathProgramCache]: Analyzing trace with hash 419618100, now seen corresponding path program 1 times [2024-11-10 03:46:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:46:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537033786] [2024-11-10 03:46:22,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:22,930 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-10 03:46:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:46:22,932 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-10 03:46:22,953 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-10 03:46:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:23,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:46:23,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:46:24,367 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-10 03:46:24,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:46:24,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:46:24,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537033786] [2024-11-10 03:46:24,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537033786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:24,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:24,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 03:46:24,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140330216] [2024-11-10 03:46:24,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:24,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:46:24,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:46:24,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:46:24,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:46:24,371 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-10 03:46:27,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:46:29,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:46:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:29,358 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-11-10 03:46:29,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:46:29,381 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-10 03:46:29,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:29,383 INFO L225 Difference]: With dead ends: 164 [2024-11-10 03:46:29,383 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 03:46:29,384 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-10 03:46:29,385 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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-10 03:46:29,386 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-10 03:46:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 03:46:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2024-11-10 03:46:29,401 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-10 03:46:29,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-11-10 03:46:29,406 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 112 [2024-11-10 03:46:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-11-10 03:46:29,408 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-10 03:46:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-11-10 03:46:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:46:29,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:29,410 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-10 03:46:29,423 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-10 03:46:29,610 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-10 03:46:29,611 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1927169909, now seen corresponding path program 1 times [2024-11-10 03:46:29,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:46:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722173942] [2024-11-10 03:46:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:29,613 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-10 03:46:29,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:46:29,614 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-10 03:46:29,615 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-10 03:46:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:29,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 03:46:29,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:46:29,948 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-10 03:46:29,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:46:29,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:46:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722173942] [2024-11-10 03:46:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722173942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:46:29,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:46:29,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:46:29,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074639211] [2024-11-10 03:46:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:46:29,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:46:29,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:46:29,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:46:29,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:46:29,950 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-10 03:46:32,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:46:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:46:32,601 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-10 03:46:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:46:32,602 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-10 03:46:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:46:32,604 INFO L225 Difference]: With dead ends: 162 [2024-11-10 03:46:32,604 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 03:46:32,604 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-10 03:46:32,605 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:46:32,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 03:46:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 03:46:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-10 03:46:32,618 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-10 03:46:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-10 03:46:32,620 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 112 [2024-11-10 03:46:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:46:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-10 03:46:32,620 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-10 03:46:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-10 03:46:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 03:46:32,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:46:32,622 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-10 03:46:32,638 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-10 03:46:32,823 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-10 03:46:32,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:46:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:46:32,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1762849621, now seen corresponding path program 1 times [2024-11-10 03:46:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:46:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938475303] [2024-11-10 03:46:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:46:32,824 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-10 03:46:32,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:46:32,826 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-10 03:46:32,826 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-10 03:46:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:46:33,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 03:46:33,133 INFO L278 TraceCheckSpWp]: Computing forward predicates...