./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:41:37,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:37,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 14:41:37,784 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:37,785 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:37,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:37,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:37,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:37,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:37,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:37,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:37,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:37,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:37,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:37,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:37,809 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:37,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:37,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:41:37,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:37,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:37,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:37,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:37,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2025-03-17 14:41:38,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:38,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:38,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:38,048 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:38,049 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:38,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-03-17 14:41:39,175 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5483d635e/ff1111db637a49ba8f056791eac6f082/FLAG574246e1c [2025-03-17 14:41:39,417 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:39,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-03-17 14:41:39,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5483d635e/ff1111db637a49ba8f056791eac6f082/FLAG574246e1c [2025-03-17 14:41:39,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5483d635e/ff1111db637a49ba8f056791eac6f082 [2025-03-17 14:41:39,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:39,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:39,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:39,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:39,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:39,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:39,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15f8cb8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39, skipping insertion in model container [2025-03-17 14:41:39,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:39,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:39,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:39,957 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:39,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:39,998 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:39,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39 WrapperNode [2025-03-17 14:41:39,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:39,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:39,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:39,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:40,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,025 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 209 [2025-03-17 14:41:40,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:40,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:40,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:40,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:40,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,044 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]. [2025-03-17 14:41:40,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,048 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:40,052 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:40,052 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:40,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:40,053 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (1/1) ... [2025-03-17 14:41:40,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:40,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:40,087 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) [2025-03-17 14:41:40,089 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 [2025-03-17 14:41:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:40,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 14:41:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-17 14:41:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-17 14:41:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:40,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 14:41:40,112 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 14:41:40,169 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:40,171 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:40,541 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:40,541 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:40,560 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:40,560 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 14:41:40,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:40 BoogieIcfgContainer [2025-03-17 14:41:40,561 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:40,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:40,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:40,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:40,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:39" (1/3) ... [2025-03-17 14:41:40,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7347bd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:40, skipping insertion in model container [2025-03-17 14:41:40,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:39" (2/3) ... [2025-03-17 14:41:40,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7347bd09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:40, skipping insertion in model container [2025-03-17 14:41:40,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:40" (3/3) ... [2025-03-17 14:41:40,569 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2025-03-17 14:41:40,581 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:40,582 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3.c.cil.c that has 3 procedures, 132 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-03-17 14:41:40,626 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:40,637 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;@7e18229b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:40,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 14:41:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 98 states have (on average 1.683673469387755) internal successors, (165), 122 states have internal predecessors, (165), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 14:41:40,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:41:40,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:40,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:40,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1438446378, now seen corresponding path program 1 times [2025-03-17 14:41:40,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:40,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938775973] [2025-03-17 14:41:40,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:40,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:41:40,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:41:40,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:40,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:40,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:40,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938775973] [2025-03-17 14:41:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938775973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:40,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:40,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:40,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565048529] [2025-03-17 14:41:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:40,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:40,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:40,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:40,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:40,859 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.683673469387755) internal successors, (165), 122 states have internal predecessors, (165), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:40,996 INFO L93 Difference]: Finished difference Result 313 states and 454 transitions. [2025-03-17 14:41:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:40,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:41:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,004 INFO L225 Difference]: With dead ends: 313 [2025-03-17 14:41:41,005 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 14:41:41,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:41,010 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 85 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 455 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 14:41:41,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2025-03-17 14:41:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 115 states have (on average 1.5217391304347827) internal successors, (175), 132 states have internal predecessors, (175), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 187 transitions. [2025-03-17 14:41:41,045 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 187 transitions. Word has length 7 [2025-03-17 14:41:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,046 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 187 transitions. [2025-03-17 14:41:41,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 187 transitions. [2025-03-17 14:41:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:41:41,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,049 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:41:41,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:41,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2052867440, now seen corresponding path program 1 times [2025-03-17 14:41:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077946181] [2025-03-17 14:41:41,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:41:41,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:41:41,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 14:41:41,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077946181] [2025-03-17 14:41:41,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077946181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:41,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:41,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620080022] [2025-03-17 14:41:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,098 INFO L87 Difference]: Start difference. First operand 142 states and 187 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,159 INFO L93 Difference]: Finished difference Result 142 states and 187 transitions. [2025-03-17 14:41:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:41:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,163 INFO L225 Difference]: With dead ends: 142 [2025-03-17 14:41:41,163 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 14:41:41,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:41,164 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 14:41:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 14:41:41,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.5043478260869565) internal successors, (173), 131 states have internal predecessors, (173), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 185 transitions. [2025-03-17 14:41:41,172 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 185 transitions. Word has length 11 [2025-03-17 14:41:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,172 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 185 transitions. [2025-03-17 14:41:41,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 185 transitions. [2025-03-17 14:41:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:41,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:41,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:41:41,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:41,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1128343021, now seen corresponding path program 1 times [2025-03-17 14:41:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360407383] [2025-03-17 14:41:41,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:41,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:41,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360407383] [2025-03-17 14:41:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360407383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207697964] [2025-03-17 14:41:41,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:41,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:41,271 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:41,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:41:41,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:41,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:41,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:41,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:41,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207697964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:41,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585794207] [2025-03-17 14:41:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:41,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:41,358 INFO L87 Difference]: Start difference. First operand 141 states and 185 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,436 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2025-03-17 14:41:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:41:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,438 INFO L225 Difference]: With dead ends: 169 [2025-03-17 14:41:41,438 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 14:41:41,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:41,439 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 31 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 206 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 14:41:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2025-03-17 14:41:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 139 states have internal predecessors, (183), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 195 transitions. [2025-03-17 14:41:41,447 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 195 transitions. Word has length 12 [2025-03-17 14:41:41,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,448 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 195 transitions. [2025-03-17 14:41:41,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 195 transitions. [2025-03-17 14:41:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 14:41:41,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,449 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:41,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:41:41,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:41,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:41,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 785618798, now seen corresponding path program 1 times [2025-03-17 14:41:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799704452] [2025-03-17 14:41:41,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:41,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:41,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:41,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799704452] [2025-03-17 14:41:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799704452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198709827] [2025-03-17 14:41:41,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:41,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:41,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:41:41,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 14:41:41,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 14:41:41,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:41,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:41,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:41,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:41,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198709827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:41,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-17 14:41:41,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118588659] [2025-03-17 14:41:41,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:41,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:41,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:41,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:41,765 INFO L87 Difference]: Start difference. First operand 149 states and 195 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:41,815 INFO L93 Difference]: Finished difference Result 154 states and 202 transitions. [2025-03-17 14:41:41,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:41,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-17 14:41:41,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:41,816 INFO L225 Difference]: With dead ends: 154 [2025-03-17 14:41:41,816 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 14:41:41,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:41,817 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 16 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:41,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 194 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:41,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 14:41:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2025-03-17 14:41:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.4838709677419355) internal successors, (184), 140 states have internal predecessors, (184), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2025-03-17 14:41:41,835 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 12 [2025-03-17 14:41:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:41,835 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2025-03-17 14:41:41,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2025-03-17 14:41:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:41:41,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:41,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:41,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:41:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 14:41:42,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -618895277, now seen corresponding path program 1 times [2025-03-17 14:41:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12341530] [2025-03-17 14:41:42,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:41:42,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:41:42,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:41:42,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12341530] [2025-03-17 14:41:42,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12341530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:42,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521252358] [2025-03-17 14:41:42,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:42,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,067 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,104 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2025-03-17 14:41:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:42,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:41:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,106 INFO L225 Difference]: With dead ends: 150 [2025-03-17 14:41:42,106 INFO L226 Difference]: Without dead ends: 149 [2025-03-17 14:41:42,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,108 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-17 14:41:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2025-03-17 14:41:42,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 122 states have (on average 1.4754098360655739) internal successors, (180), 137 states have internal predecessors, (180), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 192 transitions. [2025-03-17 14:41:42,116 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 192 transitions. Word has length 13 [2025-03-17 14:41:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,116 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 192 transitions. [2025-03-17 14:41:42,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 192 transitions. [2025-03-17 14:41:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:41:42,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 14:41:42,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1594189979, now seen corresponding path program 1 times [2025-03-17 14:41:42,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619249172] [2025-03-17 14:41:42,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:41:42,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:41:42,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619249172] [2025-03-17 14:41:42,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619249172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185645256] [2025-03-17 14:41:42,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,149 INFO L87 Difference]: Start difference. First operand 147 states and 192 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,187 INFO L93 Difference]: Finished difference Result 282 states and 366 transitions. [2025-03-17 14:41:42,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:41:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,189 INFO L225 Difference]: With dead ends: 282 [2025-03-17 14:41:42,189 INFO L226 Difference]: Without dead ends: 157 [2025-03-17 14:41:42,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,190 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 204 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:42,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-17 14:41:42,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 149. [2025-03-17 14:41:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 139 states have internal predecessors, (180), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 192 transitions. [2025-03-17 14:41:42,198 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 192 transitions. Word has length 13 [2025-03-17 14:41:42,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,198 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 192 transitions. [2025-03-17 14:41:42,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,198 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 192 transitions. [2025-03-17 14:41:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:41:42,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,199 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:41:42,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1311065065, now seen corresponding path program 1 times [2025-03-17 14:41:42,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-03-17 14:41:42,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:41:42,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:41:42,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20817874] [2025-03-17 14:41:42,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20817874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:42,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423835542] [2025-03-17 14:41:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:42,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:42,244 INFO L87 Difference]: Start difference. First operand 149 states and 192 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:42,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,340 INFO L93 Difference]: Finished difference Result 213 states and 275 transitions. [2025-03-17 14:41:42,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:42,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:41:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,341 INFO L225 Difference]: With dead ends: 213 [2025-03-17 14:41:42,342 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 14:41:42,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:42,343 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 139 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 307 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 14:41:42,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 193. [2025-03-17 14:41:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.4404761904761905) internal successors, (242), 182 states have internal predecessors, (242), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 254 transitions. [2025-03-17 14:41:42,360 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 254 transitions. Word has length 15 [2025-03-17 14:41:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,360 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 254 transitions. [2025-03-17 14:41:42,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2025-03-17 14:41:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:41:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,362 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 14:41:42,362 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1311104848, now seen corresponding path program 1 times [2025-03-17 14:41:42,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533292775] [2025-03-17 14:41:42,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:41:42,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:41:42,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533292775] [2025-03-17 14:41:42,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533292775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:42,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670638411] [2025-03-17 14:41:42,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:42,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:42,398 INFO L87 Difference]: Start difference. First operand 193 states and 254 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,478 INFO L93 Difference]: Finished difference Result 215 states and 276 transitions. [2025-03-17 14:41:42,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:42,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-17 14:41:42,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,479 INFO L225 Difference]: With dead ends: 215 [2025-03-17 14:41:42,479 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 14:41:42,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:42,480 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 139 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 312 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:42,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 14:41:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 195. [2025-03-17 14:41:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 184 states have internal predecessors, (241), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 253 transitions. [2025-03-17 14:41:42,503 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 253 transitions. Word has length 15 [2025-03-17 14:41:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,503 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 253 transitions. [2025-03-17 14:41:42,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2025-03-17 14:41:42,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:42,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 14:41:42,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -2005665931, now seen corresponding path program 1 times [2025-03-17 14:41:42,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428742482] [2025-03-17 14:41:42,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:42,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:42,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428742482] [2025-03-17 14:41:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428742482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:41:42,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037117027] [2025-03-17 14:41:42,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:42,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:42,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:42,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:41:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:42,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:42,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,620 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037117027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 14:41:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-17 14:41:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505811031] [2025-03-17 14:41:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:42,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:42,622 INFO L87 Difference]: Start difference. First operand 195 states and 253 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,676 INFO L93 Difference]: Finished difference Result 210 states and 274 transitions. [2025-03-17 14:41:42,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:42,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:41:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,678 INFO L225 Difference]: With dead ends: 210 [2025-03-17 14:41:42,678 INFO L226 Difference]: Without dead ends: 209 [2025-03-17 14:41:42,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 14:41:42,679 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 296 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-17 14:41:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 195. [2025-03-17 14:41:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.4058823529411764) internal successors, (239), 184 states have internal predecessors, (239), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 251 transitions. [2025-03-17 14:41:42,686 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 251 transitions. Word has length 14 [2025-03-17 14:41:42,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,686 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 251 transitions. [2025-03-17 14:41:42,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 251 transitions. [2025-03-17 14:41:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:42,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 14:41:42,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:42,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -161426870, now seen corresponding path program 1 times [2025-03-17 14:41:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166483538] [2025-03-17 14:41:42,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:42,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:42,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:42,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:42,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:42,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166483538] [2025-03-17 14:41:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166483538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:42,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:42,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:42,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518893189] [2025-03-17 14:41:42,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:42,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:42,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:42,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:42,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,909 INFO L87 Difference]: Start difference. First operand 195 states and 251 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:42,945 INFO L93 Difference]: Finished difference Result 370 states and 472 transitions. [2025-03-17 14:41:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 14:41:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:42,946 INFO L225 Difference]: With dead ends: 370 [2025-03-17 14:41:42,946 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 14:41:42,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:42,947 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:42,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 209 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:42,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 14:41:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2025-03-17 14:41:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 184 states have internal predecessors, (234), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 246 transitions. [2025-03-17 14:41:42,954 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 246 transitions. Word has length 14 [2025-03-17 14:41:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:42,954 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 246 transitions. [2025-03-17 14:41:42,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:42,954 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 246 transitions. [2025-03-17 14:41:42,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 14:41:42,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:42,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:42,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 14:41:42,955 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:42,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:42,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1547890878, now seen corresponding path program 1 times [2025-03-17 14:41:42,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:42,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-17 14:41:42,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:42,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:42,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 14:41:42,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 14:41:42,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:42,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:43,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772660985] [2025-03-17 14:41:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772660985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:43,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917537442] [2025-03-17 14:41:43,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:43,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:43,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:43,018 INFO L87 Difference]: Start difference. First operand 195 states and 246 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,061 INFO L93 Difference]: Finished difference Result 345 states and 434 transitions. [2025-03-17 14:41:43,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:43,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 14:41:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,062 INFO L225 Difference]: With dead ends: 345 [2025-03-17 14:41:43,062 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 14:41:43,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:43,063 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 4 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 314 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 14:41:43,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-03-17 14:41:43,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 129 states have (on average 1.3953488372093024) internal successors, (180), 143 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 192 transitions. [2025-03-17 14:41:43,068 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 192 transitions. Word has length 15 [2025-03-17 14:41:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,068 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 192 transitions. [2025-03-17 14:41:43,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2025-03-17 14:41:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:43,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,069 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:43,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 14:41:43,069 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:43,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 925518349, now seen corresponding path program 1 times [2025-03-17 14:41:43,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407295443] [2025-03-17 14:41:43,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:43,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:43,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:41:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407295443] [2025-03-17 14:41:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407295443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827334673] [2025-03-17 14:41:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:43,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:43,101 INFO L87 Difference]: Start difference. First operand 154 states and 192 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,189 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2025-03-17 14:41:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 14:41:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,191 INFO L225 Difference]: With dead ends: 162 [2025-03-17 14:41:43,191 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 14:41:43,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:43,192 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 130 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 353 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 14:41:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2025-03-17 14:41:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.37984496124031) internal successors, (178), 141 states have internal predecessors, (178), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 190 transitions. [2025-03-17 14:41:43,199 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 190 transitions. Word has length 22 [2025-03-17 14:41:43,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 190 transitions. [2025-03-17 14:41:43,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 190 transitions. [2025-03-17 14:41:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:43,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,200 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:43,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 14:41:43,200 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:43,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 925478566, now seen corresponding path program 1 times [2025-03-17 14:41:43,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407398070] [2025-03-17 14:41:43,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:43,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 14:41:43,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:41:43,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407398070] [2025-03-17 14:41:43,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407398070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:43,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:43,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:43,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733493442] [2025-03-17 14:41:43,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:43,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 14:41:43,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:41:43,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 14:41:43,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:43,230 INFO L87 Difference]: Start difference. First operand 152 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:43,308 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2025-03-17 14:41:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:41:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-17 14:41:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:43,310 INFO L225 Difference]: With dead ends: 161 [2025-03-17 14:41:43,310 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 14:41:43,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:43,310 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 134 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:43,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 360 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:41:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 14:41:43,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2025-03-17 14:41:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.371900826446281) internal successors, (166), 131 states have internal predecessors, (166), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 178 transitions. [2025-03-17 14:41:43,316 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 178 transitions. Word has length 22 [2025-03-17 14:41:43,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:43,316 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 178 transitions. [2025-03-17 14:41:43,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 14:41:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2025-03-17 14:41:43,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 14:41:43,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:43,317 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:43,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 14:41:43,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1135226102, now seen corresponding path program 1 times [2025-03-17 14:41:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:41:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975228733] [2025-03-17 14:41:43,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:41:43,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:43,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:43,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:41:43,323 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:41:43,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 14:41:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 14:41:43,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:43,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:41:43,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 14:41:43,336 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:41:43,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-17 14:41:43,340 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-17 14:41:43,342 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-17 14:41:43,343 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-17 14:41:43,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 14:41:43,345 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:43,364 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:41:43,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:43 BoogieIcfgContainer [2025-03-17 14:41:43,367 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:41:43,368 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:41:43,368 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:41:43,368 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:41:43,369 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:40" (3/4) ... [2025-03-17 14:41:43,370 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 14:41:43,371 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:41:43,371 INFO L158 Benchmark]: Toolchain (without parser) took 3599.72ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 43.3MB in the end (delta: 80.2MB). Peak memory consumption was 78.3MB. Max. memory is 16.1GB. [2025-03-17 14:41:43,371 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:43,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.95ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 109.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:41:43,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.62ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:43,372 INFO L158 Benchmark]: Boogie Preprocessor took 25.75ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:43,372 INFO L158 Benchmark]: IcfgBuilder took 508.19ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 77.4MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 14:41:43,373 INFO L158 Benchmark]: TraceAbstraction took 2805.14ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 44.3MB in the end (delta: 33.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. [2025-03-17 14:41:43,373 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory was 44.3MB in the beginning and 43.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:43,374 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.88ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.95ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 109.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.62ms. Allocated memory is still 167.8MB. Free memory was 109.8MB in the beginning and 107.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.75ms. Allocated memory is still 167.8MB. Free memory was 107.8MB in the beginning and 105.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 508.19ms. Allocated memory is still 167.8MB. Free memory was 105.8MB in the beginning and 77.4MB in the end (delta: 28.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2805.14ms. Allocated memory is still 167.8MB. Free memory was 77.4MB in the beginning and 44.3MB in the end (delta: 33.1MB). Peak memory consumption was 36.4MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 167.8MB. Free memory was 44.3MB in the beginning and 43.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=0, eb=0] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 132 locations, 192 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 713 mSDsluCounter, 3611 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2160 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 893 IncrementalHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 1451 mSDtfsCounter, 893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=8, InterpolantAutomatonStates: 55, 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, 13 MinimizatonAttempts, 124 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 245 NumberOfCodeBlocks, 245 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 150 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 35/42 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 14:41:43,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:41:45,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:41:45,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2025-03-17 14:41:45,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:41:45,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:41:45,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:41:45,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:41:45,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:41:45,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:41:45,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:41:45,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:41:45,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:41:45,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:41:45,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:41:45,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:41:45,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 14:41:45,331 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:41:45,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:41:45,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:45,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:41:45,333 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2025-03-17 14:41:45,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:41:45,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:41:45,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:41:45,580 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:41:45,581 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:41:45,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-03-17 14:41:46,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3208db42/acc2ff623b2740ff8df8cf2ad4dcad29/FLAGb9740acc3 [2025-03-17 14:41:46,956 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:41:46,958 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2025-03-17 14:41:46,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3208db42/acc2ff623b2740ff8df8cf2ad4dcad29/FLAGb9740acc3 [2025-03-17 14:41:47,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3208db42/acc2ff623b2740ff8df8cf2ad4dcad29 [2025-03-17 14:41:47,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:41:47,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:41:47,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:47,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:41:47,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:41:47,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e2ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47, skipping insertion in model container [2025-03-17 14:41:47,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:41:47,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:47,473 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:41:47,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:41:47,513 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:41:47,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47 WrapperNode [2025-03-17 14:41:47,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:41:47,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:47,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:41:47,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:41:47,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,542 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2025-03-17 14:41:47,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:41:47,542 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:41:47,542 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:41:47,542 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:41:47,548 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,561 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]. [2025-03-17 14:41:47,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,572 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,575 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,576 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:41:47,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:41:47,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:41:47,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:41:47,577 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (1/1) ... [2025-03-17 14:41:47,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:41:47,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:47,610 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) [2025-03-17 14:41:47,612 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 [2025-03-17 14:41:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 14:41:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 14:41:47,635 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-03-17 14:41:47,635 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-03-17 14:41:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:41:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:41:47,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 14:41:47,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 14:41:47,703 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:41:47,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:41:48,059 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-17 14:41:48,060 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:41:48,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:41:48,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:41:48,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:48 BoogieIcfgContainer [2025-03-17 14:41:48,073 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:41:48,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:41:48,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:41:48,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:41:48,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:41:47" (1/3) ... [2025-03-17 14:41:48,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:48, skipping insertion in model container [2025-03-17 14:41:48,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:41:47" (2/3) ... [2025-03-17 14:41:48,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d4435b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:41:48, skipping insertion in model container [2025-03-17 14:41:48,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:48" (3/3) ... [2025-03-17 14:41:48,083 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2025-03-17 14:41:48,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:41:48,094 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_1-3.c.cil.c that has 3 procedures, 108 locations, 1 initial locations, 2 loop locations, and 22 error locations. [2025-03-17 14:41:48,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:41:48,144 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;@2101c523, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:41:48,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-17 14:41:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 98 states have internal predecessors, (128), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 14:41:48,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:41:48,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1188976009, now seen corresponding path program 1 times [2025-03-17 14:41:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:41:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939590680] [2025-03-17 14:41:48,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 14:41:48,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:41:48,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:41:48,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:48,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:48,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:41:48,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939590680] [2025-03-17 14:41:48,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939590680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:48,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:48,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 14:41:48,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595719513] [2025-03-17 14:41:48,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:41:48,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:48,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:48,300 INFO L87 Difference]: Start difference. First operand has 108 states, 74 states have (on average 1.7297297297297298) internal successors, (128), 98 states have internal predecessors, (128), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,377 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2025-03-17 14:41:48,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:41:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,387 INFO L225 Difference]: With dead ends: 210 [2025-03-17 14:41:48,387 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 14:41:48,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:48,395 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 380 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:48,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 14:41:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 14:41:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 69 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:48,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2025-03-17 14:41:48,433 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 7 [2025-03-17 14:41:48,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,433 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2025-03-17 14:41:48,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:41:48,434 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2025-03-17 14:41:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 14:41:48,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,435 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 14:41:48,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:48,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash 554545472, now seen corresponding path program 1 times [2025-03-17 14:41:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:41:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1628960327] [2025-03-17 14:41:48,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:48,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 14:41:48,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 14:41:48,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 14:41:48,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:48,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:48,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 14:41:48,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:48,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:41:48,695 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:48,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:41:48,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628960327] [2025-03-17 14:41:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628960327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:41:48,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060804376] [2025-03-17 14:41:48,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:48,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:41:48,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:41:48,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:41:48,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:48,701 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:48,738 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2025-03-17 14:41:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:41:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-17 14:41:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:48,745 INFO L225 Difference]: With dead ends: 79 [2025-03-17 14:41:48,745 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 14:41:48,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:41:48,747 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:48,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:41:48,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 14:41:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 14:41:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 68 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2025-03-17 14:41:48,756 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 14 [2025-03-17 14:41:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:48,756 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2025-03-17 14:41:48,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2025-03-17 14:41:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 14:41:48,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:48,757 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:48,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 14:41:48,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:48,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:48,959 INFO L85 PathProgramCache]: Analyzing trace with hash 343498670, now seen corresponding path program 1 times [2025-03-17 14:41:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:41:48,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147163653] [2025-03-17 14:41:48,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:48,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:48,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:48,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:48,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 14:41:48,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 14:41:49,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 14:41:49,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:41:49,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:49,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:49,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:41:49,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147163653] [2025-03-17 14:41:49,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147163653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:49,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:49,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 14:41:49,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499293121] [2025-03-17 14:41:49,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 14:41:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:41:49,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 14:41:49,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 14:41:49,060 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:49,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:49,406 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2025-03-17 14:41:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 14:41:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-17 14:41:49,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:49,409 INFO L225 Difference]: With dead ends: 98 [2025-03-17 14:41:49,409 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 14:41:49,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 14:41:49,411 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:49,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 184 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:41:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 14:41:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 87. [2025-03-17 14:41:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.378787878787879) internal successors, (91), 77 states have internal predecessors, (91), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2025-03-17 14:41:49,420 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 16 [2025-03-17 14:41:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:49,420 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2025-03-17 14:41:49,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2025-03-17 14:41:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:41:49,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:49,421 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:49,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 14:41:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:49,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash -181131700, now seen corresponding path program 1 times [2025-03-17 14:41:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:41:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586277683] [2025-03-17 14:41:49,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:49,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:49,624 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:49,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 14:41:49,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:41:49,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:41:49,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:49,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:41:49,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:41:49,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:41:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:41:50,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 14:41:50,152 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 14:41:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586277683] [2025-03-17 14:41:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586277683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:41:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:41:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 14:41:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010181412] [2025-03-17 14:41:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:41:50,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:41:50,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 14:41:50,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:41:50,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:41:50,153 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:41:52,451 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2025-03-17 14:41:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 14:41:52,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-17 14:41:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:41:52,455 INFO L225 Difference]: With dead ends: 100 [2025-03-17 14:41:52,455 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 14:41:52,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:41:52,456 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 14:41:52,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 313 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 14:41:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 14:41:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 74. [2025-03-17 14:41:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 64 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 14:41:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2025-03-17 14:41:52,478 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 19 [2025-03-17 14:41:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:41:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2025-03-17 14:41:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-17 14:41:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2025-03-17 14:41:52,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-17 14:41:52,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:41:52,479 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:41:52,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 14:41:52,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:52,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-17 14:41:52,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:41:52,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1738213289, now seen corresponding path program 1 times [2025-03-17 14:41:52,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 14:41:52,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1373678980] [2025-03-17 14:41:52,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:41:52,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:52,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:41:52,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:41:52,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:41:52,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:41:52,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:41:52,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:41:52,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 14:41:52,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-17 14:41:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-17 14:41:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:41:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 14:41:52,734 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-03-17 14:41:52,735 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 14:41:52,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-17 14:41:52,738 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-17 14:41:52,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-17 14:41:52,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 14:41:52,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:41:52,942 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-17 14:41:52,955 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:41:52,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:41:52 BoogieIcfgContainer [2025-03-17 14:41:52,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:41:52,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:41:52,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:41:52,959 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:41:52,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:41:48" (3/4) ... [2025-03-17 14:41:52,960 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-17 14:41:52,998 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 8. [2025-03-17 14:41:53,033 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:41:53,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:41:53,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:41:53,036 INFO L158 Benchmark]: Toolchain (without parser) took 5739.27ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 59.9MB in the beginning and 70.0MB in the end (delta: -10.1MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-03-17 14:41:53,036 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:53,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.88ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 45.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 14:41:53,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.80ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 43.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:53,037 INFO L158 Benchmark]: Boogie Preprocessor took 33.89ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 41.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:41:53,037 INFO L158 Benchmark]: IcfgBuilder took 496.25ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 50.0MB in the end (delta: -8.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2025-03-17 14:41:53,038 INFO L158 Benchmark]: TraceAbstraction took 4882.22ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.2MB in the beginning and 25.6MB in the end (delta: 23.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-03-17 14:41:53,038 INFO L158 Benchmark]: Witness Printer took 76.58ms. Allocated memory is still 100.7MB. Free memory was 25.6MB in the beginning and 70.0MB in the end (delta: -44.5MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-03-17 14:41:53,039 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 83.9MB. Free memory is still 50.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.88ms. Allocated memory is still 83.9MB. Free memory was 59.8MB in the beginning and 45.0MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.80ms. Allocated memory is still 83.9MB. Free memory was 45.0MB in the beginning and 43.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.89ms. Allocated memory is still 83.9MB. Free memory was 43.3MB in the beginning and 41.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 496.25ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 50.0MB in the end (delta: -8.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4882.22ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.2MB in the beginning and 25.6MB in the end (delta: 23.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Witness Printer took 76.58ms. Allocated memory is still 100.7MB. Free memory was 25.6MB in the beginning and 70.0MB in the end (delta: -44.5MB). Peak memory consumption was 12.5MB. 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 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 108 locations, 155 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1032 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 675 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 188 IncrementalHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 357 mSDtfsCounter, 188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=0, InterpolantAutomatonStates: 18, 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, 4 MinimizatonAttempts, 29 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 52 ConstructedInterpolants, 17 QuantifiedInterpolants, 173 SizeOfPredicates, 3 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 6/6 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-17 14:41:53,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)