./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:48:29,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:48:29,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:48:29,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:48:29,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:48:29,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:48:29,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:48:29,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:48:29,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:48:29,193 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:48:29,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:48:29,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:48:29,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:48:29,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:48:29,194 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:48:29,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:48:29,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:48:29,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:48:29,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:48:29,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:48:29,195 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:48:29,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:48:29,201 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:48:29,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:48:29,202 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:48:29,202 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:48:29,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:48:29,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:48:29,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:48:29,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:48:29,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:48:29,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:48:29,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:48:29,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:48:29,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:48:29,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:48:29,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:48:29,206 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 [2024-10-13 05:48:29,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:48:29,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:48:29,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:48:29,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:48:29,460 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:48:29,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:30,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:48:31,177 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:48:31,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:31,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f982a24/e47abb4152f74164b9964518e81d5415/FLAGbde84cef4 [2024-10-13 05:48:31,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f982a24/e47abb4152f74164b9964518e81d5415 [2024-10-13 05:48:31,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:48:31,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:48:31,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:48:31,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:48:31,209 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:48:31,210 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdeb117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31, skipping insertion in model container [2024-10-13 05:48:31,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:48:31,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i[913,926] [2024-10-13 05:48:31,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:48:31,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:48:31,415 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i[913,926] [2024-10-13 05:48:31,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:48:31,442 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:48:31,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31 WrapperNode [2024-10-13 05:48:31,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:48:31,445 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:48:31,445 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:48:31,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:48:31,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,485 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-13 05:48:31,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:48:31,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:48:31,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:48:31,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:48:31,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:48:31,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:48:31,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:48:31,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:48:31,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:48:31,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (1/1) ... [2024-10-13 05:48:31,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:48:31,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:48:31,598 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:48:31,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:48:31,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:48:31,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:48:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:48:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:48:31,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:48:31,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:48:31,757 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:48:31,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:48:31,984 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 05:48:31,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:48:32,012 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:48:32,013 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:48:32,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:32 BoogieIcfgContainer [2024-10-13 05:48:32,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:48:32,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:48:32,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:48:32,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:48:32,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:48:31" (1/3) ... [2024-10-13 05:48:32,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:32, skipping insertion in model container [2024-10-13 05:48:32,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:31" (2/3) ... [2024-10-13 05:48:32,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222b8ae7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:32, skipping insertion in model container [2024-10-13 05:48:32,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:32" (3/3) ... [2024-10-13 05:48:32,020 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:32,033 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:48:32,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:48:32,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:48:32,080 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;@524a8800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:48:32,080 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:48:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 05:48:32,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:32,093 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:32,093 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:32,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:32,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1981177798, now seen corresponding path program 1 times [2024-10-13 05:48:32,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:32,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333651105] [2024-10-13 05:48:32,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:32,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:32,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:32,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333651105] [2024-10-13 05:48:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333651105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:48:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424089440] [2024-10-13 05:48:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:32,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:48:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:48:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:48:32,414 INFO L87 Difference]: Start difference. First operand has 56 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 42 states have internal predecessors, (59), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:48:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:32,458 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2024-10-13 05:48:32,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:48:32,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-10-13 05:48:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:32,468 INFO L225 Difference]: With dead ends: 109 [2024-10-13 05:48:32,468 INFO L226 Difference]: Without dead ends: 54 [2024-10-13 05:48:32,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:48:32,474 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:32,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:48:32,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-13 05:48:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-13 05:48:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2024-10-13 05:48:32,507 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 82 [2024-10-13 05:48:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:32,508 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2024-10-13 05:48:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:48:32,508 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2024-10-13 05:48:32,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 05:48:32,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:32,511 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:32,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:48:32,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:32,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1547244098, now seen corresponding path program 1 times [2024-10-13 05:48:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:32,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469537140] [2024-10-13 05:48:32,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:32,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:32,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469537140] [2024-10-13 05:48:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469537140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:32,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:32,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:48:32,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783429610] [2024-10-13 05:48:32,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:32,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:48:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:48:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:32,714 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:32,765 INFO L93 Difference]: Finished difference Result 133 states and 191 transitions. [2024-10-13 05:48:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:48:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-13 05:48:32,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:32,767 INFO L225 Difference]: With dead ends: 133 [2024-10-13 05:48:32,768 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 05:48:32,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:32,769 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 34 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:32,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 142 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:48:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 05:48:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2024-10-13 05:48:32,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2024-10-13 05:48:32,782 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 82 [2024-10-13 05:48:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:32,783 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2024-10-13 05:48:32,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:32,783 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2024-10-13 05:48:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-13 05:48:32,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:32,787 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:32,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:48:32,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:32,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:32,788 INFO L85 PathProgramCache]: Analyzing trace with hash -846179520, now seen corresponding path program 1 times [2024-10-13 05:48:32,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:32,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333436737] [2024-10-13 05:48:32,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:32,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333436737] [2024-10-13 05:48:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333436737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:48:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774098182] [2024-10-13 05:48:32,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:32,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:48:32,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:32,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:48:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:32,983 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:33,033 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-10-13 05:48:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:48:33,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 82 [2024-10-13 05:48:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:33,035 INFO L225 Difference]: With dead ends: 109 [2024-10-13 05:48:33,035 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 05:48:33,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:33,038 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:33,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:48:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 05:48:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 05:48:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:33,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-10-13 05:48:33,044 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 82 [2024-10-13 05:48:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:33,045 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-10-13 05:48:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-10-13 05:48:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-13 05:48:33,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:33,047 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:33,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:48:33,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:33,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:33,050 INFO L85 PathProgramCache]: Analyzing trace with hash -312165467, now seen corresponding path program 1 times [2024-10-13 05:48:33,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:33,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685978300] [2024-10-13 05:48:33,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:33,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:33,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:33,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685978300] [2024-10-13 05:48:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685978300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:48:33,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193594052] [2024-10-13 05:48:33,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:48:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:48:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:48:33,514 INFO L87 Difference]: Start difference. First operand 55 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:33,620 INFO L93 Difference]: Finished difference Result 135 states and 189 transitions. [2024-10-13 05:48:33,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:48:33,621 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 84 [2024-10-13 05:48:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:33,622 INFO L225 Difference]: With dead ends: 135 [2024-10-13 05:48:33,622 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 05:48:33,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:48:33,623 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:33,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 223 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:48:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 05:48:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 67. [2024-10-13 05:48:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-10-13 05:48:33,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 84 [2024-10-13 05:48:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:33,630 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-10-13 05:48:33,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-10-13 05:48:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-13 05:48:33,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:33,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:33,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:48:33,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:33,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1416162689, now seen corresponding path program 1 times [2024-10-13 05:48:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086640865] [2024-10-13 05:48:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:33,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:33,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:33,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086640865] [2024-10-13 05:48:33,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086640865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:33,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:33,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:48:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396903510] [2024-10-13 05:48:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:33,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:48:33,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:33,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:48:33,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:33,875 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:33,936 INFO L93 Difference]: Finished difference Result 186 states and 263 transitions. [2024-10-13 05:48:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:48:33,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2024-10-13 05:48:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:33,940 INFO L225 Difference]: With dead ends: 186 [2024-10-13 05:48:33,940 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 05:48:33,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:33,941 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:33,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 147 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:48:33,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 05:48:33,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2024-10-13 05:48:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 90 states have internal predecessors, (115), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-13 05:48:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 163 transitions. [2024-10-13 05:48:33,955 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 163 transitions. Word has length 85 [2024-10-13 05:48:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:33,956 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 163 transitions. [2024-10-13 05:48:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 163 transitions. [2024-10-13 05:48:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 05:48:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:33,957 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:33,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 05:48:33,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:33,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:33,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1131812814, now seen corresponding path program 1 times [2024-10-13 05:48:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:33,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051701902] [2024-10-13 05:48:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:33,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:34,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:34,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:34,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:34,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051701902] [2024-10-13 05:48:34,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051701902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:34,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:34,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:48:34,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656334602] [2024-10-13 05:48:34,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:34,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:48:34,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:34,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:48:34,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:48:34,093 INFO L87 Difference]: Start difference. First operand 117 states and 163 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:34,196 INFO L93 Difference]: Finished difference Result 342 states and 473 transitions. [2024-10-13 05:48:34,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:48:34,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-10-13 05:48:34,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:34,198 INFO L225 Difference]: With dead ends: 342 [2024-10-13 05:48:34,198 INFO L226 Difference]: Without dead ends: 276 [2024-10-13 05:48:34,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:48:34,200 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 142 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:34,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 287 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:48:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-10-13 05:48:34,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 231. [2024-10-13 05:48:34,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 178 states have (on average 1.2752808988764044) internal successors, (227), 178 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 05:48:34,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 323 transitions. [2024-10-13 05:48:34,223 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 323 transitions. Word has length 86 [2024-10-13 05:48:34,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 323 transitions. [2024-10-13 05:48:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 323 transitions. [2024-10-13 05:48:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 05:48:34,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:34,225 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:34,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 05:48:34,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:34,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 120695564, now seen corresponding path program 1 times [2024-10-13 05:48:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113888086] [2024-10-13 05:48:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,650 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:34,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:34,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113888086] [2024-10-13 05:48:34,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113888086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:34,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:34,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:48:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702443225] [2024-10-13 05:48:34,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:34,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:48:34,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:34,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:48:34,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:48:34,653 INFO L87 Difference]: Start difference. First operand 231 states and 323 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:34,855 INFO L93 Difference]: Finished difference Result 504 states and 697 transitions. [2024-10-13 05:48:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 05:48:34,855 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 86 [2024-10-13 05:48:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:34,858 INFO L225 Difference]: With dead ends: 504 [2024-10-13 05:48:34,858 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 05:48:34,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 05:48:34,859 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 87 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:34,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 271 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:48:34,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 05:48:34,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 282. [2024-10-13 05:48:34,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 216 states have internal predecessors, (274), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:48:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 394 transitions. [2024-10-13 05:48:34,886 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 394 transitions. Word has length 86 [2024-10-13 05:48:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:34,887 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 394 transitions. [2024-10-13 05:48:34,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 394 transitions. [2024-10-13 05:48:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 05:48:34,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:34,888 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:34,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 05:48:34,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:34,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1051844427, now seen corresponding path program 1 times [2024-10-13 05:48:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298824436] [2024-10-13 05:48:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:48:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 05:48:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:48:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 05:48:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 05:48:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:48:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:48:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:48:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:48:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 05:48:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:48:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 05:48:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:34,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:48:34,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298824436] [2024-10-13 05:48:34,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298824436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:34,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:34,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:48:34,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931800288] [2024-10-13 05:48:34,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:34,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:48:34,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:48:34,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:48:34,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:34,975 INFO L87 Difference]: Start difference. First operand 282 states and 394 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:35,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:35,016 INFO L93 Difference]: Finished difference Result 512 states and 716 transitions. [2024-10-13 05:48:35,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:48:35,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 87 [2024-10-13 05:48:35,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:35,019 INFO L225 Difference]: With dead ends: 512 [2024-10-13 05:48:35,019 INFO L226 Difference]: Without dead ends: 282 [2024-10-13 05:48:35,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:35,021 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:35,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:48:35,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-13 05:48:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-10-13 05:48:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 216 states have (on average 1.2407407407407407) internal successors, (268), 216 states have internal predecessors, (268), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 05:48:35,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 388 transitions. [2024-10-13 05:48:35,051 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 388 transitions. Word has length 87 [2024-10-13 05:48:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:35,051 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 388 transitions. [2024-10-13 05:48:35,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 388 transitions. [2024-10-13 05:48:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 05:48:35,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:35,052 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:35,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 05:48:35,053 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:35,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1964995131, now seen corresponding path program 1 times [2024-10-13 05:48:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:48:35,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779910336] [2024-10-13 05:48:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:48:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:48:35,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:48:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:48:35,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:48:35,134 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:48:35,136 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:48:35,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 05:48:35,141 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:35,212 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:48:35,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:48:35 BoogieIcfgContainer [2024-10-13 05:48:35,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:48:35,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:48:35,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:48:35,216 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:48:35,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:32" (3/4) ... [2024-10-13 05:48:35,218 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:48:35,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:48:35,219 INFO L158 Benchmark]: Toolchain (without parser) took 4017.22ms. Allocated memory was 192.9MB in the beginning and 272.6MB in the end (delta: 79.7MB). Free memory was 123.3MB in the beginning and 94.8MB in the end (delta: 28.4MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,220 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:48:35,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.19ms. Allocated memory is still 192.9MB. Free memory was 123.0MB in the beginning and 108.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.70ms. Allocated memory is still 192.9MB. Free memory was 108.8MB in the beginning and 106.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,220 INFO L158 Benchmark]: Boogie Preprocessor took 46.60ms. Allocated memory is still 192.9MB. Free memory was 106.0MB in the beginning and 102.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,221 INFO L158 Benchmark]: RCFGBuilder took 479.42ms. Allocated memory is still 192.9MB. Free memory was 102.6MB in the beginning and 143.9MB in the end (delta: -41.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,221 INFO L158 Benchmark]: TraceAbstraction took 3200.51ms. Allocated memory was 192.9MB in the beginning and 272.6MB in the end (delta: 79.7MB). Free memory was 142.9MB in the beginning and 94.8MB in the end (delta: 48.1MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-10-13 05:48:35,221 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 272.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:48:35,222 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.14ms. Allocated memory is still 192.9MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.19ms. Allocated memory is still 192.9MB. Free memory was 123.0MB in the beginning and 108.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.70ms. Allocated memory is still 192.9MB. Free memory was 108.8MB in the beginning and 106.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.60ms. Allocated memory is still 192.9MB. Free memory was 106.0MB in the beginning and 102.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 479.42ms. Allocated memory is still 192.9MB. Free memory was 102.6MB in the beginning and 143.9MB in the end (delta: -41.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3200.51ms. Allocated memory was 192.9MB in the beginning and 272.6MB in the end (delta: 79.7MB). Free memory was 142.9MB in the beginning and 94.8MB in the end (delta: 48.1MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 272.6MB. Free memory is still 94.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of shiftRight at line 60, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] double var_1_7 = 256.75; [L26] double var_1_8 = 63.5; [L27] double var_1_9 = 1.8; [L28] double var_1_10 = 0.25; [L29] double var_1_11 = 16.5; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] float var_1_15 = 4.6; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L93] last_1_var_1_12 = var_1_12 [L94] last_1_var_1_17 = var_1_17 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=0, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_8=127/2, var_1_9=9/5] [L77] var_1_8 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L78] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 2305843.009213691390e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4, var_1_9=9/5] [L79] var_1_9 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L80] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=1/4, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L81] var_1_10 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L82] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_11=33/2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L83] var_1_11 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L84] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=128, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L86] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L87] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L88] var_1_18 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L89] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L90] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L105] RET updateVariables() [L106] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L44] COND FALSE !(stepLocal_1 && var_1_5) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_7=1027/4] [L54] COND TRUE \read(var_1_2) [L55] var_1_7 = (((var_1_8 + var_1_9) + var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=23/5, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-256, var_1_12=-5, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L62] COND FALSE !((~ var_1_17) <= stepLocal_3) [L67] var_1_12 = (var_1_17 - var_1_14) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L97-L98] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((double) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((float) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_12=127, var_1_14=127, var_1_15=505, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=10, var_1_2=1, var_1_5=1, var_1_8=505] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 333 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 333 mSDsluCounter, 1399 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 780 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 345 IncrementalHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 619 mSDtfsCounter, 345 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 179 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 761 NumberOfCodeBlocks, 761 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 1385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 2112/2112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:48:35,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.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 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:48:37,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:48:37,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:48:37,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:48:37,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:48:37,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:48:37,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:48:37,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:48:37,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:48:37,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:48:37,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:48:37,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:48:37,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:48:37,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:48:37,567 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:48:37,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:48:37,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:48:37,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:48:37,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:48:37,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:48:37,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:48:37,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:48:37,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:48:37,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:48:37,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:48:37,571 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:48:37,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:48:37,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:48:37,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:48:37,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:48:37,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:48:37,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:48:37,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:48:37,573 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:48:37,574 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:48:37,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:48:37,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:48:37,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:48:37,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:48:37,576 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:48:37,576 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 -> 90e35651bfd9b45448f3c544aad64e7f8bfb379d8aba00be42275ca318b2d740 [2024-10-13 05:48:38,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:48:38,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:48:38,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:48:38,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:48:38,055 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:48:38,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:39,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:48:39,797 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:48:39,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:39,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aa8f7c9/81c05c0d1dec4de783e0700970c554bb/FLAG73855c590 [2024-10-13 05:48:39,823 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88aa8f7c9/81c05c0d1dec4de783e0700970c554bb [2024-10-13 05:48:39,825 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:48:39,826 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:48:39,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:48:39,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:48:39,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:48:39,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:39" (1/1) ... [2024-10-13 05:48:39,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:39, skipping insertion in model container [2024-10-13 05:48:39,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:48:39" (1/1) ... [2024-10-13 05:48:39,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:48:40,001 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i[913,926] [2024-10-13 05:48:40,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:48:40,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:48:40,084 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-55.i[913,926] [2024-10-13 05:48:40,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:48:40,131 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:48:40,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40 WrapperNode [2024-10-13 05:48:40,132 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:48:40,133 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:48:40,133 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:48:40,133 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:48:40,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,172 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-13 05:48:40,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:48:40,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:48:40,177 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:48:40,177 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:48:40,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:48:40,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,228 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,241 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,242 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,248 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:48:40,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:48:40,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:48:40,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:48:40,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (1/1) ... [2024-10-13 05:48:40,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:48:40,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:48:40,284 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:48:40,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:48:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:48:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:48:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:48:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:48:40,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:48:40,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:48:40,440 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:48:40,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:48:43,273 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 05:48:43,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:48:43,327 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:48:43,328 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:48:43,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:43 BoogieIcfgContainer [2024-10-13 05:48:43,328 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:48:43,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:48:43,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:48:43,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:48:43,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:48:39" (1/3) ... [2024-10-13 05:48:43,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:43, skipping insertion in model container [2024-10-13 05:48:43,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:48:40" (2/3) ... [2024-10-13 05:48:43,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ffb9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:48:43, skipping insertion in model container [2024-10-13 05:48:43,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:48:43" (3/3) ... [2024-10-13 05:48:43,338 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-55.i [2024-10-13 05:48:43,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:48:43,353 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:48:43,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:48:43,413 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;@73fe17b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:48:43,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:48:43,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:43,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:48:43,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:43,428 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:43,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1113787404, now seen corresponding path program 1 times [2024-10-13 05:48:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:48:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120288687] [2024-10-13 05:48:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:43,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:48:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:48:43,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:48:43,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:48:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:43,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:48:43,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:48:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 05:48:43,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:48:43,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:48:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120288687] [2024-10-13 05:48:43,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120288687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:48:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002948386] [2024-10-13 05:48:43,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:43,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:48:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:48:43,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:48:43,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:48:43,861 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:48:46,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:48:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:46,066 INFO L93 Difference]: Finished difference Result 77 states and 130 transitions. [2024-10-13 05:48:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:48:46,094 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 77 [2024-10-13 05:48:46,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:46,100 INFO L225 Difference]: With dead ends: 77 [2024-10-13 05:48:46,100 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 05:48:46,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:48:46,104 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:46,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 05:48:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 05:48:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 05:48:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2024-10-13 05:48:46,135 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 77 [2024-10-13 05:48:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:46,136 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2024-10-13 05:48:46,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-13 05:48:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2024-10-13 05:48:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:48:46,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:46,138 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:46,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 05:48:46,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:48:46,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:46,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:46,344 INFO L85 PathProgramCache]: Analyzing trace with hash 866099988, now seen corresponding path program 1 times [2024-10-13 05:48:46,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:48:46,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475322397] [2024-10-13 05:48:46,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:46,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:48:46,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:48:46,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:48:46,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:48:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:46,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 05:48:46,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:48:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-13 05:48:46,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:48:46,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:48:46,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475322397] [2024-10-13 05:48:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475322397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:48:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:48:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:48:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119775977] [2024-10-13 05:48:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:48:46,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:48:46,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:48:46,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:48:46,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:46,669 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:48,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:48:51,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 05:48:51,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:48:51,319 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2024-10-13 05:48:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:48:51,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 77 [2024-10-13 05:48:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:48:51,351 INFO L225 Difference]: With dead ends: 85 [2024-10-13 05:48:51,351 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 05:48:51,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:48:51,353 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-13 05:48:51,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-13 05:48:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 05:48:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-10-13 05:48:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 05:48:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-13 05:48:51,361 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 77 [2024-10-13 05:48:51,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:48:51,363 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-13 05:48:51,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-13 05:48:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-13 05:48:51,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:48:51,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:48:51,365 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:48:51,381 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-10-13 05:48:51,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:48:51,566 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:48:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:48:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 923358290, now seen corresponding path program 1 times [2024-10-13 05:48:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:48:51,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963956486] [2024-10-13 05:48:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:48:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:48:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:48:51,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:48:51,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 05:48:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:48:51,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-13 05:48:51,926 INFO L278 TraceCheckSpWp]: Computing forward predicates...