./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:47:09,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:47:09,656 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:47:09,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:47:09,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:47:09,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:47:09,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:47:09,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:47:09,681 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:47:09,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:47:09,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:47:09,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:47:09,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:47:09,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:47:09,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:47:09,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:47:09,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:47:09,686 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:47:09,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:47:09,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:47:09,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:47:09,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:47:09,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:47:09,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:47:09,689 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:47:09,689 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:47:09,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:47:09,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:47:09,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:47:09,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:47:09,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:47:09,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:47:09,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:47:09,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:47:09,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:47:09,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:47:09,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:47:09,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:47:09,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:47:09,693 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:47:09,693 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:47:09,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:47:09,694 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-12 04:47:09,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:47:09,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:47:09,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:47:09,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:47:09,974 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:47:09,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:11,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:47:11,712 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:47:11,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:11,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85448becb/813a49b397c24ca1816b48ec4fe1566b/FLAG6b4133be2 [2024-11-12 04:47:12,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85448becb/813a49b397c24ca1816b48ec4fe1566b [2024-11-12 04:47:12,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:47:12,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:47:12,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:47:12,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:47:12,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:47:12,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56be9673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12, skipping insertion in model container [2024-11-12 04:47:12,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:47:12,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-12 04:47:12,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:47:12,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:47:12,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-12 04:47:12,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:47:12,387 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:47:12,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12 WrapperNode [2024-11-12 04:47:12,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:47:12,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:47:12,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:47:12,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:47:12,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,478 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-12 04:47:12,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:47:12,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:47:12,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:47:12,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:47:12,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:47:12,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:47:12,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:47:12,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:47:12,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:47:12,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (1/1) ... [2024-11-12 04:47:12,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:47:12,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:47:12,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:47:12,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:47:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:47:12,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:47:12,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:47:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:47:12,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:47:12,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:47:12,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:47:12,713 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:47:12,994 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 04:47:12,994 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:47:13,011 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:47:13,013 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:47:13,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:13 BoogieIcfgContainer [2024-11-12 04:47:13,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:47:13,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:47:13,016 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:47:13,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:47:13,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:47:12" (1/3) ... [2024-11-12 04:47:13,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99c9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:13, skipping insertion in model container [2024-11-12 04:47:13,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:12" (2/3) ... [2024-11-12 04:47:13,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99c9ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:13, skipping insertion in model container [2024-11-12 04:47:13,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:13" (3/3) ... [2024-11-12 04:47:13,024 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:13,041 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:47:13,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:47:13,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:47:13,122 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;@59aa099a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:47:13,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:47:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:47:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:47:13,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:13,139 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:13,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1007460807, now seen corresponding path program 1 times [2024-11-12 04:47:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:13,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107065224] [2024-11-12 04:47:13,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:13,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:13,530 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:13,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107065224] [2024-11-12 04:47:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107065224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:13,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:13,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:47:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908950407] [2024-11-12 04:47:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:47:13,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:47:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:47:13,570 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:47:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:13,602 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-12 04:47:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:47:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-12 04:47:13,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:13,611 INFO L225 Difference]: With dead ends: 113 [2024-11-12 04:47:13,612 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 04:47:13,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:47:13,619 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:13,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:47:13,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 04:47:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-12 04:47:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:47:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-12 04:47:13,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 116 [2024-11-12 04:47:13,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:13,663 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-12 04:47:13,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:47:13,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-12 04:47:13,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:47:13,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:13,667 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:47:13,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:13,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:13,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2128078073, now seen corresponding path program 1 times [2024-11-12 04:47:13,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:13,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398379279] [2024-11-12 04:47:13,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:13,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:14,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:14,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:14,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398379279] [2024-11-12 04:47:14,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398379279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:14,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:14,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:47:14,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023433879] [2024-11-12 04:47:14,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:14,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:47:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:14,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:47:14,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:47:14,093 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:14,221 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2024-11-12 04:47:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:47:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-12 04:47:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:14,225 INFO L225 Difference]: With dead ends: 143 [2024-11-12 04:47:14,226 INFO L226 Difference]: Without dead ends: 90 [2024-11-12 04:47:14,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:47:14,228 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:14,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 162 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:47:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-12 04:47:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-12 04:47:14,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 04:47:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-12 04:47:14,252 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 116 [2024-11-12 04:47:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:14,253 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-12 04:47:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-12 04:47:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-12 04:47:14,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:14,258 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:14,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:47:14,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:14,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1869912635, now seen corresponding path program 1 times [2024-11-12 04:47:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:14,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572612619] [2024-11-12 04:47:14,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:14,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:15,878 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:15,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:15,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572612619] [2024-11-12 04:47:15,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572612619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:15,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:15,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:47:15,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388210327] [2024-11-12 04:47:15,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:15,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:47:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:15,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:47:15,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:47:15,883 INFO L87 Difference]: Start difference. First operand 87 states and 119 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:16,198 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2024-11-12 04:47:16,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:47:16,199 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-12 04:47:16,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:16,202 INFO L225 Difference]: With dead ends: 194 [2024-11-12 04:47:16,202 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 04:47:16,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:47:16,204 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:16,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:47:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 04:47:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-11-12 04:47:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.144927536231884) internal successors, (79), 71 states have internal predecessors, (79), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:47:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2024-11-12 04:47:16,221 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 116 [2024-11-12 04:47:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:16,222 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2024-11-12 04:47:16,222 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2024-11-12 04:47:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:47:16,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:16,224 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:16,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:47:16,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:16,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:16,225 INFO L85 PathProgramCache]: Analyzing trace with hash 180128188, now seen corresponding path program 1 times [2024-11-12 04:47:16,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153421792] [2024-11-12 04:47:16,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:16,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:17,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:17,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153421792] [2024-11-12 04:47:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153421792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:17,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:17,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:47:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201918098] [2024-11-12 04:47:17,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:17,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:47:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:17,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:47:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:47:17,204 INFO L87 Difference]: Start difference. First operand 107 states and 147 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:17,504 INFO L93 Difference]: Finished difference Result 204 states and 277 transitions. [2024-11-12 04:47:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 04:47:17,505 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-12 04:47:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:17,507 INFO L225 Difference]: With dead ends: 204 [2024-11-12 04:47:17,507 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 04:47:17,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:47:17,509 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:17,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 391 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:47:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 04:47:17,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-11-12 04:47:17,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:47:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-11-12 04:47:17,526 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 118 [2024-11-12 04:47:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:17,526 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-11-12 04:47:17,527 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-11-12 04:47:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:47:17,528 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:17,529 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:17,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:47:17,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:17,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash 855559414, now seen corresponding path program 1 times [2024-11-12 04:47:17,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:17,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271058259] [2024-11-12 04:47:17,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:17,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:20,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:20,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:20,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271058259] [2024-11-12 04:47:20,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271058259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:20,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:47:20,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290646353] [2024-11-12 04:47:20,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:20,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:47:20,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:20,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:47:20,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:47:20,179 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:20,756 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2024-11-12 04:47:20,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 04:47:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-12 04:47:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:20,758 INFO L225 Difference]: With dead ends: 147 [2024-11-12 04:47:20,759 INFO L226 Difference]: Without dead ends: 145 [2024-11-12 04:47:20,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:47:20,760 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 64 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:20,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 522 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:47:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-12 04:47:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2024-11-12 04:47:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:47:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-11-12 04:47:20,798 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-11-12 04:47:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:20,798 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-11-12 04:47:20,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-11-12 04:47:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-12 04:47:20,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:20,802 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:20,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:47:20,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:20,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:20,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1535617784, now seen corresponding path program 1 times [2024-11-12 04:47:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474686605] [2024-11-12 04:47:20,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:22,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:22,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474686605] [2024-11-12 04:47:22,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474686605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:22,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:22,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:47:22,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559989693] [2024-11-12 04:47:22,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:22,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:47:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:22,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:47:22,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:47:22,767 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:23,309 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-11-12 04:47:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 04:47:23,310 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-12 04:47:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:23,312 INFO L225 Difference]: With dead ends: 154 [2024-11-12 04:47:23,312 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 04:47:23,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:47:23,314 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:23,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 662 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:47:23,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 04:47:23,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2024-11-12 04:47:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:47:23,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-11-12 04:47:23,335 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-11-12 04:47:23,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:23,335 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-11-12 04:47:23,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,336 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-11-12 04:47:23,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:47:23,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:23,337 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:23,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:47:23,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:23,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:23,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1795480909, now seen corresponding path program 1 times [2024-11-12 04:47:23,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:23,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528161204] [2024-11-12 04:47:23,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:23,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:23,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528161204] [2024-11-12 04:47:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528161204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:23,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:23,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:47:23,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106934201] [2024-11-12 04:47:23,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:23,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:47:23,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:23,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:47:23,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:47:23,424 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:23,478 INFO L93 Difference]: Finished difference Result 261 states and 337 transitions. [2024-11-12 04:47:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:47:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-12 04:47:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:23,481 INFO L225 Difference]: With dead ends: 261 [2024-11-12 04:47:23,481 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 04:47:23,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:47:23,482 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:23,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:47:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 04:47:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-12 04:47:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 102 states have internal predecessors, (110), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 04:47:23,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2024-11-12 04:47:23,511 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 120 [2024-11-12 04:47:23,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:23,511 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2024-11-12 04:47:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,512 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2024-11-12 04:47:23,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-12 04:47:23,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:23,513 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:23,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:47:23,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:23,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:23,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1491412089, now seen corresponding path program 1 times [2024-11-12 04:47:23,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:23,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-11-12 04:47:23,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:23,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 04:47:23,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063930922] [2024-11-12 04:47:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063930922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:23,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:23,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:47:23,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71264926] [2024-11-12 04:47:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:23,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:47:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:23,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:47:23,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:47:23,599 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:23,656 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2024-11-12 04:47:23,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:47:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-12 04:47:23,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:23,659 INFO L225 Difference]: With dead ends: 286 [2024-11-12 04:47:23,660 INFO L226 Difference]: Without dead ends: 152 [2024-11-12 04:47:23,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:47:23,663 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:23,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:47:23,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-12 04:47:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2024-11-12 04:47:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 04:47:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2024-11-12 04:47:23,692 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 120 [2024-11-12 04:47:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:23,692 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2024-11-12 04:47:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 04:47:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2024-11-12 04:47:23,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:47:23,694 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:23,694 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:23,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:47:23,695 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:23,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:23,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1674406324, now seen corresponding path program 1 times [2024-11-12 04:47:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604961874] [2024-11-12 04:47:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:23,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:47:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:47:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:47:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:47:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:47:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:47:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 04:47:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:47:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 04:47:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:47:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 04:47:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:47:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:47:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 04:47:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:47:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 04:47:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:47:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 04:47:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,888 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 04:47:23,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:47:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604961874] [2024-11-12 04:47:23,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604961874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:47:23,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427120110] [2024-11-12 04:47:23,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:47:23,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:47:23,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:47:23,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:47:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:23,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 04:47:24,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:47:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 126 proven. 167 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-12 04:47:27,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:47:31,390 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 04:47:31,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427120110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:47:31,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:47:31,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 13] total 28 [2024-11-12 04:47:31,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435868834] [2024-11-12 04:47:31,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:47:31,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-12 04:47:31,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:47:31,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-12 04:47:31,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-12 04:47:31,393 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 04:47:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:31,993 INFO L93 Difference]: Finished difference Result 232 states and 286 transitions. [2024-11-12 04:47:31,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 04:47:31,994 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 122 [2024-11-12 04:47:31,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:31,995 INFO L225 Difference]: With dead ends: 232 [2024-11-12 04:47:31,996 INFO L226 Difference]: Without dead ends: 117 [2024-11-12 04:47:31,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2024-11-12 04:47:31,997 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:31,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 334 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:47:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-12 04:47:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-11-12 04:47:32,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 04:47:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2024-11-12 04:47:32,016 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 122 [2024-11-12 04:47:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2024-11-12 04:47:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-12 04:47:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2024-11-12 04:47:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 04:47:32,018 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:32,018 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:32,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 04:47:32,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:47:32,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -626416266, now seen corresponding path program 1 times [2024-11-12 04:47:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:47:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559463104] [2024-11-12 04:47:32,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:32,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:47:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:47:32,278 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:47:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:47:32,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:47:32,352 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:47:32,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:47:32,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:47:32,358 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:32,444 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:47:32,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:47:32 BoogieIcfgContainer [2024-11-12 04:47:32,447 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:47:32,447 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:47:32,447 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:47:32,448 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:47:32,448 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:13" (3/4) ... [2024-11-12 04:47:32,450 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:47:32,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:47:32,452 INFO L158 Benchmark]: Toolchain (without parser) took 20377.27ms. Allocated memory was 151.0MB in the beginning and 700.4MB in the end (delta: 549.5MB). Free memory was 83.1MB in the beginning and 306.7MB in the end (delta: -223.6MB). Peak memory consumption was 327.4MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,452 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:47:32,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.85ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 124.4MB in the end (delta: -41.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.89ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 122.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,453 INFO L158 Benchmark]: Boogie Preprocessor took 51.00ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,454 INFO L158 Benchmark]: RCFGBuilder took 478.46ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 102.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,454 INFO L158 Benchmark]: TraceAbstraction took 19430.64ms. Allocated memory was 151.0MB in the beginning and 700.4MB in the end (delta: 549.5MB). Free memory was 101.7MB in the beginning and 307.8MB in the end (delta: -206.1MB). Peak memory consumption was 343.9MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,454 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 700.4MB. Free memory was 307.8MB in the beginning and 306.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:47:32,456 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.18ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.85ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 124.4MB in the end (delta: -41.5MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.89ms. Allocated memory is still 151.0MB. Free memory was 124.4MB in the beginning and 122.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.00ms. Allocated memory is still 151.0MB. Free memory was 122.1MB in the beginning and 119.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.46ms. Allocated memory is still 151.0MB. Free memory was 119.4MB in the beginning and 102.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19430.64ms. Allocated memory was 151.0MB in the beginning and 700.4MB in the end (delta: 549.5MB). Free memory was 101.7MB in the beginning and 307.8MB in the end (delta: -206.1MB). Peak memory consumption was 343.9MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 700.4MB. Free memory was 307.8MB in the beginning and 306.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 255; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 99; [L30] signed long int var_1_10 = 255; [L31] signed long int var_1_11 = 24; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_15 = 1928642731; [L35] signed short int var_1_18 = 0; [L36] unsigned short int var_1_19 = 5; VAL [isInitial=0, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=63, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L63] var_1_3 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L66] var_1_5 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L67] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L69] var_1_6 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L81] var_1_13 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L82] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L83] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L83] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L84] var_1_15 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L85] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L86] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L86] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L99] RET updateVariables() [L100] CALL step() [L40] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L41] COND TRUE stepLocal_0 < var_1_6 [L42] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L44] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L45] var_1_18 = var_1_5 [L46] var_1_19 = var_1_6 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L47] COND TRUE (var_1_2 - var_1_3) <= (- var_1_8) [L48] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L52] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L52] signed long int stepLocal_1 = var_1_6 | 5; [L53] COND TRUE stepLocal_1 <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))) [L54] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91-L92] return (((((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19)))))) && (var_1_18 == ((signed short int) var_1_5))) && (var_1_19 == ((unsigned short int) var_1_6)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.3s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 2710 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1931 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1530 IncrementalHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 779 mSDtfsCounter, 1530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 581 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 6615 SizeOfPredicates, 13 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6493/6732 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 04:47:32,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:47:34,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:47:34,962 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:47:34,968 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:47:34,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:47:35,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:47:35,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:47:35,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:47:35,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:47:35,014 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:47:35,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:47:35,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:47:35,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:47:35,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:47:35,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:47:35,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:47:35,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:47:35,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:47:35,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:47:35,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:47:35,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:47:35,022 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:47:35,022 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:47:35,022 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:47:35,023 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:47:35,023 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:47:35,023 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:47:35,023 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:47:35,023 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:47:35,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:47:35,024 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:47:35,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:47:35,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:47:35,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:47:35,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:47:35,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:47:35,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:47:35,028 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:47:35,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:47:35,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:47:35,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:47:35,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:47:35,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:47:35,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:47:35,030 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-12 04:47:35,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:47:35,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:47:35,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:47:35,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:47:35,418 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:47:35,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:37,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:47:37,353 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:47:37,353 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:37,371 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bff7c71/58be691e90f0486f82baf5a2e88f1686/FLAG95146ec69 [2024-11-12 04:47:37,693 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08bff7c71/58be691e90f0486f82baf5a2e88f1686 [2024-11-12 04:47:37,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:47:37,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:47:37,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:47:37,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:47:37,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:47:37,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:37" (1/1) ... [2024-11-12 04:47:37,710 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d20925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:37, skipping insertion in model container [2024-11-12 04:47:37,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:47:37" (1/1) ... [2024-11-12 04:47:37,741 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:47:37,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-12 04:47:37,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:47:37,988 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:47:38,004 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-12 04:47:38,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:47:38,058 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:47:38,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38 WrapperNode [2024-11-12 04:47:38,059 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:47:38,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:47:38,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:47:38,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:47:38,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,102 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-12 04:47:38,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:47:38,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:47:38,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:47:38,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:47:38,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,133 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:47:38,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,147 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:47:38,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:47:38,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:47:38,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:47:38,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (1/1) ... [2024-11-12 04:47:38,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:47:38,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:47:38,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:47:38,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:47:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:47:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:47:38,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:47:38,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:47:38,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:47:38,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:47:38,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:47:38,352 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:47:38,637 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 04:47:38,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:47:38,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:47:38,654 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:47:38,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:38 BoogieIcfgContainer [2024-11-12 04:47:38,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:47:38,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:47:38,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:47:38,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:47:38,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:47:37" (1/3) ... [2024-11-12 04:47:38,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1667d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:38, skipping insertion in model container [2024-11-12 04:47:38,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:47:38" (2/3) ... [2024-11-12 04:47:38,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1667d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:47:38, skipping insertion in model container [2024-11-12 04:47:38,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:47:38" (3/3) ... [2024-11-12 04:47:38,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-12 04:47:38,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:47:38,694 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:47:38,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:47:38,780 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;@96593f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:47:38,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:47:38,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:47:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:47:38,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:38,801 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:38,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:38,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:38,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1196679678, now seen corresponding path program 1 times [2024-11-12 04:47:38,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:47:38,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1260534583] [2024-11-12 04:47:38,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:38,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:47:38,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:47:38,847 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:47:38,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 04:47:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:39,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:47:39,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:47:39,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-12 04:47:39,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:47:39,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:47:39,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1260534583] [2024-11-12 04:47:39,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1260534583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:47:39,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:47:39,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:47:39,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997344399] [2024-11-12 04:47:39,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:47:39,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:47:39,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:47:39,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:47:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:47:39,097 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:47:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:39,132 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2024-11-12 04:47:39,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:47:39,134 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-12 04:47:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:39,141 INFO L225 Difference]: With dead ends: 95 [2024-11-12 04:47:39,142 INFO L226 Difference]: Without dead ends: 47 [2024-11-12 04:47:39,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:47:39,152 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:39,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:47:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-12 04:47:39,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-12 04:47:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:47:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-12 04:47:39,205 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 113 [2024-11-12 04:47:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:39,206 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-12 04:47:39,206 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-12 04:47:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-12 04:47:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:47:39,210 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:39,211 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:39,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 04:47:39,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:47:39,412 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 95620930, now seen corresponding path program 1 times [2024-11-12 04:47:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:47:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200902596] [2024-11-12 04:47:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:47:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:47:39,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:47:39,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 04:47:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:39,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:47:39,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:47:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-12 04:47:39,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:47:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-12 04:47:40,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:47:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200902596] [2024-11-12 04:47:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200902596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:47:40,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:47:40,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 04:47:40,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932477211] [2024-11-12 04:47:40,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:47:40,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:47:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:47:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:47:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:47:40,124 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-12 04:47:40,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:47:40,451 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-12 04:47:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:47:40,453 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 113 [2024-11-12 04:47:40,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:47:40,454 INFO L225 Difference]: With dead ends: 97 [2024-11-12 04:47:40,455 INFO L226 Difference]: Without dead ends: 53 [2024-11-12 04:47:40,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:47:40,456 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:47:40,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:47:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-12 04:47:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-12 04:47:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 04:47:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-12 04:47:40,477 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 113 [2024-11-12 04:47:40,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:47:40,480 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-12 04:47:40,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-12 04:47:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-12 04:47:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-12 04:47:40,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:47:40,484 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:47:40,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 04:47:40,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:47:40,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:47:40,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:47:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -584437440, now seen corresponding path program 1 times [2024-11-12 04:47:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:47:40,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505767207] [2024-11-12 04:47:40,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:47:40,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:47:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:47:40,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:47:40,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 04:47:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:47:40,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 04:47:40,797 INFO L279 TraceCheckSpWp]: Computing forward predicates...