./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.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 bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:58:57,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:58:58,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:58:58,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:58:58,045 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:58:58,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:58:58,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:58:58,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:58:58,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:58:58,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:58:58,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:58:58,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:58:58,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:58:58,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:58:58,076 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:58:58,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:58:58,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:58:58,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:58:58,078 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:58:58,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:58:58,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:58:58,079 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:58:58,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:58:58,080 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:58:58,080 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:58:58,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:58:58,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:58:58,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:58:58,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:58:58,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:58:58,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:58:58,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:58:58,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:58:58,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:58:58,084 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:58:58,084 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:58:58,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:58:58,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:58:58,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:58:58,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:58:58,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:58:58,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:58:58,089 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 -> bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e [2024-10-14 07:58:58,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:58:58,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:58:58,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:58:58,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:58:58,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:58:58,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:58:59,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:59:00,143 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:59:00,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:59:00,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fed780a/e0af983e6181450ebb1b41664997d8e9/FLAG08b30c76d [2024-10-14 07:59:00,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55fed780a/e0af983e6181450ebb1b41664997d8e9 [2024-10-14 07:59:00,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:59:00,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:59:00,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:59:00,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:59:00,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:59:00,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38b72c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00, skipping insertion in model container [2024-10-14 07:59:00,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:59:00,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2024-10-14 07:59:00,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:59:00,454 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:59:00,471 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2024-10-14 07:59:00,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:59:00,541 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:59:00,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00 WrapperNode [2024-10-14 07:59:00,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:59:00,543 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:59:00,544 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:59:00,544 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:59:00,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,624 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-10-14 07:59:00,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:59:00,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:59:00,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:59:00,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:59:00,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,679 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:59:00,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,716 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:59:00,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:59:00,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:59:00,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:59:00,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (1/1) ... [2024-10-14 07:59:00,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:59:00,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:59:00,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:59:00,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:59:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:59:00,832 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:59:00,833 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:59:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:59:00,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:59:00,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:59:00,929 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:59:00,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:59:01,429 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 07:59:01,429 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:59:01,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:59:01,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:59:01,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:59:01 BoogieIcfgContainer [2024-10-14 07:59:01,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:59:01,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:59:01,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:59:01,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:59:01,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:59:00" (1/3) ... [2024-10-14 07:59:01,505 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c687c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:59:01, skipping insertion in model container [2024-10-14 07:59:01,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:00" (2/3) ... [2024-10-14 07:59:01,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c687c8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:59:01, skipping insertion in model container [2024-10-14 07:59:01,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:59:01" (3/3) ... [2024-10-14 07:59:01,509 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:59:01,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:59:01,537 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:59:01,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:59:01,630 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;@180bf5fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:59:01,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:59:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 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-10-14 07:59:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 07:59:01,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:01,653 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] [2024-10-14 07:59:01,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:01,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:01,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2085102478, now seen corresponding path program 1 times [2024-10-14 07:59:01,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:01,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337901313] [2024-10-14 07:59:01,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:01,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:01,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:02,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:02,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:02,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:02,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337901313] [2024-10-14 07:59:02,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337901313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:02,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:02,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:59:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721087703] [2024-10-14 07:59:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:02,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:59:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:02,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:59:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:59:02,138 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 58 states have internal predecessors, (85), 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 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-10-14 07:59:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:02,177 INFO L93 Difference]: Finished difference Result 149 states and 248 transitions. [2024-10-14 07:59:02,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:59:02,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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 107 [2024-10-14 07:59:02,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:02,190 INFO L225 Difference]: With dead ends: 149 [2024-10-14 07:59:02,191 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 07:59:02,194 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-10-14 07:59:02,197 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:02,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:59:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 07:59:02,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-14 07:59:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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-10-14 07:59:02,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-10-14 07:59:02,251 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 107 [2024-10-14 07:59:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:02,253 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-10-14 07:59:02,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 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-10-14 07:59:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-10-14 07:59:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 07:59:02,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:02,258 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] [2024-10-14 07:59:02,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:59:02,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:02,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:02,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1798973230, now seen corresponding path program 1 times [2024-10-14 07:59:02,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:02,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929272111] [2024-10-14 07:59:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:02,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929272111] [2024-10-14 07:59:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929272111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:59:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454535649] [2024-10-14 07:59:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:02,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:59:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:02,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:59:02,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:59:02,556 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-14 07:59:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:02,650 INFO L93 Difference]: Finished difference Result 206 states and 311 transitions. [2024-10-14 07:59:02,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:59:02,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 107 [2024-10-14 07:59:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:02,654 INFO L225 Difference]: With dead ends: 206 [2024-10-14 07:59:02,654 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 07:59:02,655 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-10-14 07:59:02,658 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 99 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:02,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 254 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:59:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 07:59:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 95. [2024-10-14 07:59:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 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-10-14 07:59:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2024-10-14 07:59:02,686 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 107 [2024-10-14 07:59:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:02,688 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2024-10-14 07:59:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-10-14 07:59:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2024-10-14 07:59:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 07:59:02,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:02,691 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] [2024-10-14 07:59:02,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:59:02,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:02,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1484876816, now seen corresponding path program 1 times [2024-10-14 07:59:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:02,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188032090] [2024-10-14 07:59:02,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:02,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188032090] [2024-10-14 07:59:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188032090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:59:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78089850] [2024-10-14 07:59:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:03,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:03,251 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-14 07:59:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:03,590 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2024-10-14 07:59:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:59:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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 107 [2024-10-14 07:59:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:03,595 INFO L225 Difference]: With dead ends: 309 [2024-10-14 07:59:03,596 INFO L226 Difference]: Without dead ends: 215 [2024-10-14 07:59:03,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:59:03,600 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 117 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:03,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 350 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:59:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-14 07:59:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 181. [2024-10-14 07:59:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 146 states have internal predecessors, (204), 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-10-14 07:59:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 268 transitions. [2024-10-14 07:59:03,640 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 268 transitions. Word has length 107 [2024-10-14 07:59:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:03,641 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 268 transitions. [2024-10-14 07:59:03,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 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-10-14 07:59:03,641 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 268 transitions. [2024-10-14 07:59:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 07:59:03,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:03,646 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] [2024-10-14 07:59:03,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:59:03,647 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:03,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2055121040, now seen corresponding path program 1 times [2024-10-14 07:59:03,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:03,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549669034] [2024-10-14 07:59:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549669034] [2024-10-14 07:59:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549669034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:04,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:59:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026059817] [2024-10-14 07:59:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:04,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:59:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:59:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:59:04,285 INFO L87 Difference]: Start difference. First operand 181 states and 268 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-14 07:59:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:04,724 INFO L93 Difference]: Finished difference Result 480 states and 704 transitions. [2024-10-14 07:59:04,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:59:04,726 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 108 [2024-10-14 07:59:04,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:04,729 INFO L225 Difference]: With dead ends: 480 [2024-10-14 07:59:04,729 INFO L226 Difference]: Without dead ends: 300 [2024-10-14 07:59:04,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:59:04,733 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 114 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:04,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 528 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:59:04,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-14 07:59:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 277. [2024-10-14 07:59:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 225 states have (on average 1.3422222222222222) internal successors, (302), 225 states have internal predecessors, (302), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:59:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 398 transitions. [2024-10-14 07:59:04,772 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 398 transitions. Word has length 108 [2024-10-14 07:59:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:04,773 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 398 transitions. [2024-10-14 07:59:04,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-10-14 07:59:04,773 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 398 transitions. [2024-10-14 07:59:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 07:59:04,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:04,775 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] [2024-10-14 07:59:04,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:59:04,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:04,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 199483898, now seen corresponding path program 1 times [2024-10-14 07:59:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322775736] [2024-10-14 07:59:04,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:04,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:04,972 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:04,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:04,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322775736] [2024-10-14 07:59:04,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322775736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:04,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:04,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:59:04,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729981785] [2024-10-14 07:59:04,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:04,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:59:04,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:04,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:59:04,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:59:04,976 INFO L87 Difference]: Start difference. First operand 277 states and 398 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 07:59:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:05,009 INFO L93 Difference]: Finished difference Result 554 states and 797 transitions. [2024-10-14 07:59:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:59:05,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 109 [2024-10-14 07:59:05,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:05,013 INFO L225 Difference]: With dead ends: 554 [2024-10-14 07:59:05,013 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 07:59:05,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:59:05,018 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:05,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:59:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 07:59:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2024-10-14 07:59:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.331858407079646) internal successors, (301), 226 states have internal predecessors, (301), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:59:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 397 transitions. [2024-10-14 07:59:05,046 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 397 transitions. Word has length 109 [2024-10-14 07:59:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:05,049 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 397 transitions. [2024-10-14 07:59:05,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 07:59:05,050 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 397 transitions. [2024-10-14 07:59:05,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 07:59:05,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:05,052 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] [2024-10-14 07:59:05,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:59:05,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:05,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash 457649336, now seen corresponding path program 1 times [2024-10-14 07:59:05,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:05,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661084972] [2024-10-14 07:59:05,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:05,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661084972] [2024-10-14 07:59:05,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661084972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:05,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:05,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:59:05,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105932444] [2024-10-14 07:59:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:05,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:05,273 INFO L87 Difference]: Start difference. First operand 278 states and 397 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-10-14 07:59:05,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:05,602 INFO L93 Difference]: Finished difference Result 479 states and 692 transitions. [2024-10-14 07:59:05,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:59:05,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 109 [2024-10-14 07:59:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:05,606 INFO L225 Difference]: With dead ends: 479 [2024-10-14 07:59:05,607 INFO L226 Difference]: Without dead ends: 384 [2024-10-14 07:59:05,607 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-10-14 07:59:05,608 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 196 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:05,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 537 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:59:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-14 07:59:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 285. [2024-10-14 07:59:05,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3347639484978542) internal successors, (311), 233 states have internal predecessors, (311), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:59:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 407 transitions. [2024-10-14 07:59:05,642 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 407 transitions. Word has length 109 [2024-10-14 07:59:05,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:05,643 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 407 transitions. [2024-10-14 07:59:05,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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-10-14 07:59:05,643 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 407 transitions. [2024-10-14 07:59:05,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 07:59:05,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:05,644 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] [2024-10-14 07:59:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:59:05,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:05,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:05,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1938979579, now seen corresponding path program 1 times [2024-10-14 07:59:05,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:05,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520743349] [2024-10-14 07:59:05,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:05,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520743349] [2024-10-14 07:59:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520743349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:59:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015012523] [2024-10-14 07:59:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:59:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:59:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:59:05,972 INFO L87 Difference]: Start difference. First operand 285 states and 407 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 07:59:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:06,064 INFO L93 Difference]: Finished difference Result 601 states and 861 transitions. [2024-10-14 07:59:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:59:06,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 109 [2024-10-14 07:59:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:06,068 INFO L225 Difference]: With dead ends: 601 [2024-10-14 07:59:06,068 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 07:59:06,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:06,070 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 87 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:06,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 364 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:59:06,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 07:59:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 285. [2024-10-14 07:59:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 233 states have internal predecessors, (303), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 07:59:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 399 transitions. [2024-10-14 07:59:06,118 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 399 transitions. Word has length 109 [2024-10-14 07:59:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:06,120 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 399 transitions. [2024-10-14 07:59:06,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-10-14 07:59:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 399 transitions. [2024-10-14 07:59:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 07:59:06,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:06,121 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] [2024-10-14 07:59:06,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:59:06,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:06,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:06,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1363899368, now seen corresponding path program 1 times [2024-10-14 07:59:06,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:06,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463811877] [2024-10-14 07:59:06,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:06,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:06,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:06,356 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:06,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:06,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463811877] [2024-10-14 07:59:06,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463811877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:06,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:06,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:59:06,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307642099] [2024-10-14 07:59:06,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:06,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:06,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:06,358 INFO L87 Difference]: Start difference. First operand 285 states and 399 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-10-14 07:59:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:06,898 INFO L93 Difference]: Finished difference Result 782 states and 1091 transitions. [2024-10-14 07:59:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:59:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 113 [2024-10-14 07:59:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:06,903 INFO L225 Difference]: With dead ends: 782 [2024-10-14 07:59:06,903 INFO L226 Difference]: Without dead ends: 680 [2024-10-14 07:59:06,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:59:06,905 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 258 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:06,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 448 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:59:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-10-14 07:59:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 492. [2024-10-14 07:59:07,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 406 states have (on average 1.3004926108374384) internal successors, (528), 406 states have internal predecessors, (528), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 07:59:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 688 transitions. [2024-10-14 07:59:07,003 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 688 transitions. Word has length 113 [2024-10-14 07:59:07,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:07,006 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 688 transitions. [2024-10-14 07:59:07,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-10-14 07:59:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 688 transitions. [2024-10-14 07:59:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 07:59:07,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:07,008 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] [2024-10-14 07:59:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:59:07,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash 220228270, now seen corresponding path program 1 times [2024-10-14 07:59:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334915097] [2024-10-14 07:59:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:59:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 07:59:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 07:59:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:59:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:59:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 07:59:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 07:59:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 07:59:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 07:59:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:59:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:59:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:59:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:59:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:59:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:59:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:59:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:16,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:59:16,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334915097] [2024-10-14 07:59:16,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334915097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:16,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:16,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:59:16,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809173529] [2024-10-14 07:59:16,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:16,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:59:16,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:59:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:59:16,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:59:16,961 INFO L87 Difference]: Start difference. First operand 492 states and 688 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-10-14 07:59:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:20,970 INFO L93 Difference]: Finished difference Result 1116 states and 1528 transitions. [2024-10-14 07:59:20,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:59:20,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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 113 [2024-10-14 07:59:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:20,976 INFO L225 Difference]: With dead ends: 1116 [2024-10-14 07:59:20,976 INFO L226 Difference]: Without dead ends: 928 [2024-10-14 07:59:20,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:59:20,978 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 203 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:20,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 408 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 07:59:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-10-14 07:59:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 857. [2024-10-14 07:59:21,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 756 states have (on average 1.306878306878307) internal successors, (988), 761 states have internal predecessors, (988), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 07:59:21,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1168 transitions. [2024-10-14 07:59:21,128 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1168 transitions. Word has length 113 [2024-10-14 07:59:21,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:21,128 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1168 transitions. [2024-10-14 07:59:21,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 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-10-14 07:59:21,129 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1168 transitions. [2024-10-14 07:59:21,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 07:59:21,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:21,131 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] [2024-10-14 07:59:21,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:59:21,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:21,132 INFO L85 PathProgramCache]: Analyzing trace with hash 439082988, now seen corresponding path program 1 times [2024-10-14 07:59:21,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:59:21,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333831483] [2024-10-14 07:59:21,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:59:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:59:21,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:59:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:59:21,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:59:21,275 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:59:21,276 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:59:21,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:59:21,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:59:21,369 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:59:21,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:59:21 BoogieIcfgContainer [2024-10-14 07:59:21,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:59:21,373 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:59:21,373 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:59:21,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:59:21,374 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:59:01" (3/4) ... [2024-10-14 07:59:21,376 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:59:21,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:59:21,378 INFO L158 Benchmark]: Toolchain (without parser) took 21202.76ms. Allocated memory was 176.2MB in the beginning and 323.0MB in the end (delta: 146.8MB). Free memory was 119.5MB in the beginning and 196.0MB in the end (delta: -76.5MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,378 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:59:21,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.37ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 104.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.83ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 100.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,379 INFO L158 Benchmark]: Boogie Preprocessor took 97.43ms. Allocated memory is still 176.2MB. Free memory was 100.7MB in the beginning and 94.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,379 INFO L158 Benchmark]: RCFGBuilder took 770.71ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 94.4MB in the beginning and 189.8MB in the end (delta: -95.4MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,379 INFO L158 Benchmark]: TraceAbstraction took 19874.05ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 188.9MB in the beginning and 197.0MB in the end (delta: -8.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. [2024-10-14 07:59:21,379 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 323.0MB. Free memory was 197.0MB in the beginning and 196.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:59:21,381 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.20ms. Allocated memory is still 176.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.37ms. Allocated memory is still 176.2MB. Free memory was 119.0MB in the beginning and 104.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.83ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 100.7MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.43ms. Allocated memory is still 176.2MB. Free memory was 100.7MB in the beginning and 94.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 770.71ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 94.4MB in the beginning and 189.8MB in the end (delta: -95.4MB). Peak memory consumption was 38.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19874.05ms. Allocated memory was 222.3MB in the beginning and 323.0MB in the end (delta: 100.7MB). Free memory was 188.9MB in the beginning and 197.0MB in the end (delta: -8.1MB). Peak memory consumption was 93.6MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 323.0MB. Free memory was 197.0MB in the beginning and 196.0MB 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 someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1074 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1074 mSDsluCounter, 3208 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1949 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1273 IncrementalHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 1259 mSDtfsCounter, 1273 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=857occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 485 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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-10-14 07:59:21,427 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.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 bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:59:23,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:59:23,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:59:23,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:59:23,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:59:23,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:59:23,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:59:23,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:59:23,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:59:23,884 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:59:23,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:59:23,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:59:23,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:59:23,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:59:23,886 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:59:23,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:59:23,887 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:59:23,887 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:59:23,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:59:23,888 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:59:23,889 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:59:23,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:59:23,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:59:23,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:59:23,893 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:59:23,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:59:23,894 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:59:23,894 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:59:23,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:59:23,894 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:59:23,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:59:23,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:59:23,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:59:23,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:59:23,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:59:23,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:59:23,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:59:23,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:59:23,896 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:59:23,896 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:59:23,896 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:59:23,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:59:23,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:59:23,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:59:23,900 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:59:23,900 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 -> bc5ff12f497c9d9181efc26f3b6e3906b64720260a6608e211112ba137d1de1e [2024-10-14 07:59:24,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:59:24,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:59:24,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:59:24,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:59:24,281 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:59:24,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:59:26,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:59:26,263 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:59:26,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:59:26,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661e6fcbb/98e425763acc4c80bb34c32f8bdaac42/FLAG2991b5b42 [2024-10-14 07:59:26,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/661e6fcbb/98e425763acc4c80bb34c32f8bdaac42 [2024-10-14 07:59:26,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:59:26,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:59:26,614 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:59:26,614 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:59:26,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:59:26,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:59:26" (1/1) ... [2024-10-14 07:59:26,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:26, skipping insertion in model container [2024-10-14 07:59:26,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:59:26" (1/1) ... [2024-10-14 07:59:26,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:59:26,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2024-10-14 07:59:26,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:59:26,934 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:59:26,951 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-97.i[913,926] [2024-10-14 07:59:26,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:59:27,015 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:59:27,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27 WrapperNode [2024-10-14 07:59:27,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:59:27,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:59:27,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:59:27,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:59:27,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,080 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-14 07:59:27,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:59:27,082 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:59:27,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:59:27,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:59:27,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,121 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:59:27,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,137 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,144 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:59:27,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:59:27,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:59:27,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:59:27,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (1/1) ... [2024-10-14 07:59:27,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:59:27,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:59:27,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:59:27,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:59:27,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:59:27,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:59:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:59:27,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:59:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:59:27,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:59:27,353 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:59:27,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:59:27,695 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 07:59:27,696 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:59:27,766 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:59:27,766 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:59:27,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:59:27 BoogieIcfgContainer [2024-10-14 07:59:27,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:59:27,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:59:27,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:59:27,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:59:27,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:59:26" (1/3) ... [2024-10-14 07:59:27,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303aa8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:59:27, skipping insertion in model container [2024-10-14 07:59:27,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:59:27" (2/3) ... [2024-10-14 07:59:27,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303aa8e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:59:27, skipping insertion in model container [2024-10-14 07:59:27,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:59:27" (3/3) ... [2024-10-14 07:59:27,778 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-97.i [2024-10-14 07:59:27,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:59:27,796 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:59:27,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:59:27,868 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;@6c11b2cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:59:27,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:59:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 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-10-14 07:59:27,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 07:59:27,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:27,888 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] [2024-10-14 07:59:27,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:27,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash -882595308, now seen corresponding path program 1 times [2024-10-14 07:59:27,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:27,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097953250] [2024-10-14 07:59:27,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:27,914 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-10-14 07:59:27,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:27,918 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-10-14 07:59:27,920 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-10-14 07:59:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:28,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:59:28,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 07:59:28,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:59:28,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:28,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097953250] [2024-10-14 07:59:28,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097953250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:28,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:28,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:59:28,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199016396] [2024-10-14 07:59:28,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:28,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:59:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:59:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:59:28,233 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 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) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 07:59:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:28,280 INFO L93 Difference]: Finished difference Result 101 states and 174 transitions. [2024-10-14 07:59:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:59:28,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 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 103 [2024-10-14 07:59:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:28,296 INFO L225 Difference]: With dead ends: 101 [2024-10-14 07:59:28,296 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 07:59:28,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:59:28,304 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:28,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:59:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 07:59:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 07:59:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-10-14 07:59:28,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 75 transitions. [2024-10-14 07:59:28,346 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 75 transitions. Word has length 103 [2024-10-14 07:59:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:28,348 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 75 transitions. [2024-10-14 07:59:28,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 07:59:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 75 transitions. [2024-10-14 07:59:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 07:59:28,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:28,352 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] [2024-10-14 07:59:28,358 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-10-14 07:59:28,553 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-10-14 07:59:28,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:28,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:28,555 INFO L85 PathProgramCache]: Analyzing trace with hash 544711000, now seen corresponding path program 1 times [2024-10-14 07:59:28,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:28,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084355100] [2024-10-14 07:59:28,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:28,556 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-10-14 07:59:28,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:28,559 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-10-14 07:59:28,561 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-10-14 07:59:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:28,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 07:59:28,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-10-14 07:59:28,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:59:28,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084355100] [2024-10-14 07:59:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084355100] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:28,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:59:28,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106548244] [2024-10-14 07:59:28,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:59:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:59:28,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:59:28,869 INFO L87 Difference]: Start difference. First operand 50 states and 75 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 07:59:29,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:29,220 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2024-10-14 07:59:29,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:59:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2024-10-14 07:59:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:29,223 INFO L225 Difference]: With dead ends: 105 [2024-10-14 07:59:29,223 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 07:59:29,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 07:59:29,227 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 75 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:29,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 89 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:59:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 07:59:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-10-14 07:59:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 07:59:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-10-14 07:59:29,251 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 103 [2024-10-14 07:59:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:29,251 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-10-14 07:59:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 07:59:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-10-14 07:59:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 07:59:29,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:29,256 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] [2024-10-14 07:59:29,264 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 (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:59:29,457 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-10-14 07:59:29,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 151683990, now seen corresponding path program 1 times [2024-10-14 07:59:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333161580] [2024-10-14 07:59:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:29,459 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-10-14 07:59:29,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:29,463 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-10-14 07:59:29,464 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-10-14 07:59:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:29,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 07:59:29,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:29,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:59:29,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:29,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333161580] [2024-10-14 07:59:29,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333161580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:29,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:59:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938839241] [2024-10-14 07:59:29,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:29,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:29,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:29,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:29,890 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-10-14 07:59:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:30,102 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2024-10-14 07:59:30,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:59:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 103 [2024-10-14 07:59:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:30,105 INFO L225 Difference]: With dead ends: 139 [2024-10-14 07:59:30,105 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 07:59:30,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:59:30,107 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 78 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:30,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 220 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:59:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 07:59:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 52. [2024-10-14 07:59:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 07:59:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2024-10-14 07:59:30,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 103 [2024-10-14 07:59:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:30,127 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2024-10-14 07:59:30,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-10-14 07:59:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2024-10-14 07:59:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 07:59:30,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:30,130 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] [2024-10-14 07:59:30,139 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-10-14 07:59:30,336 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-10-14 07:59:30,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:30,338 INFO L85 PathProgramCache]: Analyzing trace with hash 718816030, now seen corresponding path program 1 times [2024-10-14 07:59:30,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:30,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890527995] [2024-10-14 07:59:30,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:30,339 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-10-14 07:59:30,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:30,342 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-10-14 07:59:30,343 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-10-14 07:59:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:30,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 07:59:30,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:59:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 07:59:31,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:59:31,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:59:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890527995] [2024-10-14 07:59:31,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890527995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:59:31,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:59:31,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:59:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726705375] [2024-10-14 07:59:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:59:31,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:59:31,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:59:31,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:59:31,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:59:31,019 INFO L87 Difference]: Start difference. First operand 52 states and 70 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 07:59:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:59:31,273 INFO L93 Difference]: Finished difference Result 160 states and 214 transitions. [2024-10-14 07:59:31,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:59:31,274 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 104 [2024-10-14 07:59:31,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:59:31,276 INFO L225 Difference]: With dead ends: 160 [2024-10-14 07:59:31,277 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 07:59:31,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:59:31,279 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 42 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:59:31,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 204 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:59:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 07:59:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2024-10-14 07:59:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.140625) internal successors, (73), 64 states have internal predecessors, (73), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 07:59:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2024-10-14 07:59:31,319 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 104 [2024-10-14 07:59:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:59:31,321 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2024-10-14 07:59:31,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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-10-14 07:59:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2024-10-14 07:59:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 07:59:31,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:59:31,326 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] [2024-10-14 07:59:31,333 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 (5)] Ended with exit code 0 [2024-10-14 07:59:31,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-14 07:59:31,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:59:31,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:59:31,527 INFO L85 PathProgramCache]: Analyzing trace with hash 808340375, now seen corresponding path program 1 times [2024-10-14 07:59:31,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:59:31,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654772459] [2024-10-14 07:59:31,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:59:31,528 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-10-14 07:59:31,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:59:31,529 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-14 07:59:31,531 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 (6)] Waiting until timeout for monitored process [2024-10-14 07:59:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:59:31,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 07:59:31,657 INFO L278 TraceCheckSpWp]: Computing forward predicates...