./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 19fc5eb310da36e5af41d4081d388b8003853571831bd141ebfde225d7512722 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:01:23,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:01:23,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-13 16:01:23,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:01:23,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:01:23,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:01:23,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:01:23,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:01:23,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:01:23,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:01:23,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:01:23,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:01:23,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:01:23,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:01:23,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:01:23,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:01:23,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:01:23,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 16:01:23,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:01:23,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:01:23,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:01:23,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:01:23,983 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:01:23,983 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:01:23,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:01:23,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:01:23,984 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:01:23,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:01:23,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:01:23,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:01:23,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:01:23,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:01:23,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:01:23,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:01:23,985 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:01:23,985 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 16:01:23,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 16:01:23,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:01:23,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:01:23,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:01:23,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:01:23,989 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19fc5eb310da36e5af41d4081d388b8003853571831bd141ebfde225d7512722 [2024-10-13 16:01:24,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:01:24,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:01:24,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:01:24,283 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:01:24,284 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:01:24,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:25,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:01:26,009 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:01:26,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:26,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6454565f/6a2e2d02c4e84fe18311969067a2d69c/FLAG6100a6ec6 [2024-10-13 16:01:26,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6454565f/6a2e2d02c4e84fe18311969067a2d69c [2024-10-13 16:01:26,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:01:26,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:01:26,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:01:26,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:01:26,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:01:26,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:26" (1/1) ... [2024-10-13 16:01:26,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16277f9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:26, skipping insertion in model container [2024-10-13 16:01:26,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:26" (1/1) ... [2024-10-13 16:01:26,315 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:01:26,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:01:26,899 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:01:26,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:01:27,089 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:01:27,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27 WrapperNode [2024-10-13 16:01:27,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:01:27,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:01:27,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:01:27,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:01:27,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,152 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 67 [2024-10-13 16:01:27,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:01:27,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:01:27,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:01:27,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:01:27,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,179 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:01:27,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:01:27,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:01:27,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:01:27,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:01:27,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (1/1) ... [2024-10-13 16:01:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:01:27,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:01:27,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 16:01:27,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 16:01:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 16:01:27,268 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 16:01:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:01:27,268 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:01:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:01:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-13 16:01:27,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-13 16:01:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:01:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:01:27,374 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:01:27,375 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:01:27,488 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-13 16:01:27,488 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:01:27,513 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:01:27,514 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 16:01:27,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:27 BoogieIcfgContainer [2024-10-13 16:01:27,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:01:27,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:01:27,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:01:27,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:01:27,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:01:26" (1/3) ... [2024-10-13 16:01:27,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae05990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:27, skipping insertion in model container [2024-10-13 16:01:27,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:27" (2/3) ... [2024-10-13 16:01:27,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae05990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:27, skipping insertion in model container [2024-10-13 16:01:27,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:27" (3/3) ... [2024-10-13 16:01:27,522 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:27,537 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:01:27,537 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 16:01:27,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:01:27,588 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;@56477028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:01:27,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 16:01:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:01:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:01:27,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:27,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:27,600 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:27,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:27,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-13 16:01:27,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:27,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103250630] [2024-10-13 16:01:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:27,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103250630] [2024-10-13 16:01:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103250630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:01:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752605033] [2024-10-13 16:01:28,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:01:28,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:01:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:01:28,058 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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) [2024-10-13 16:01:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,164 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-10-13 16:01:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:01:28,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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 11 [2024-10-13 16:01:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,173 INFO L225 Difference]: With dead ends: 56 [2024-10-13 16:01:28,173 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 16:01:28,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:01:28,180 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 162 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 16:01:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 16:01:28,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-13 16:01:28,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 29 states have internal predecessors, (35), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 16:01:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-13 16:01:28,211 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 11 [2024-10-13 16:01:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,212 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-13 16:01:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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) [2024-10-13 16:01:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-13 16:01:28,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 16:01:28,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:28,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 16:01:28,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:28,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:28,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1916119026, now seen corresponding path program 1 times [2024-10-13 16:01:28,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:28,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969805816] [2024-10-13 16:01:28,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:28,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969805816] [2024-10-13 16:01:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969805816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:01:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681996172] [2024-10-13 16:01:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:01:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:01:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:01:28,292 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 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) [2024-10-13 16:01:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,337 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-13 16:01:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:01:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 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 12 [2024-10-13 16:01:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,338 INFO L225 Difference]: With dead ends: 42 [2024-10-13 16:01:28,338 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 16:01:28,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:01:28,339 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 128 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:28,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 16:01:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-13 16:01:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 29 states have internal predecessors, (34), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 16:01:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-10-13 16:01:28,345 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-10-13 16:01:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,345 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-10-13 16:01:28,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 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) [2024-10-13 16:01:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-10-13 16:01:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 16:01:28,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:28,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 16:01:28,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:28,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-13 16:01:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:28,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946250355] [2024-10-13 16:01:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946250355] [2024-10-13 16:01:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946250355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 16:01:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966549928] [2024-10-13 16:01:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 16:01:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 16:01:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:01:28,375 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-13 16:01:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,389 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2024-10-13 16:01:28,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 16:01:28,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 12 [2024-10-13 16:01:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,391 INFO L225 Difference]: With dead ends: 39 [2024-10-13 16:01:28,391 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 16:01:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 16:01:28,392 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 56 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:28,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 16:01:28,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 16:01:28,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 16:01:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-10-13 16:01:28,397 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 12 [2024-10-13 16:01:28,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,397 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-10-13 16:01:28,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-13 16:01:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-10-13 16:01:28,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 16:01:28,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:28,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 16:01:28,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:28,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash 729330087, now seen corresponding path program 1 times [2024-10-13 16:01:28,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:28,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19485638] [2024-10-13 16:01:28,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19485638] [2024-10-13 16:01:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19485638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:01:28,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977611812] [2024-10-13 16:01:28,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:01:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:01:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:28,455 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 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) [2024-10-13 16:01:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,474 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-13 16:01:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:01:28,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 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 13 [2024-10-13 16:01:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,475 INFO L225 Difference]: With dead ends: 58 [2024-10-13 16:01:28,475 INFO L226 Difference]: Without dead ends: 30 [2024-10-13 16:01:28,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:28,476 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:28,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-13 16:01:28,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-13 16:01:28,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 16:01:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-10-13 16:01:28,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2024-10-13 16:01:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,480 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-10-13 16:01:28,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 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) [2024-10-13 16:01:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-10-13 16:01:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 16:01:28,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:28,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 16:01:28,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:28,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-13 16:01:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672073057] [2024-10-13 16:01:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:01:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:01:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672073057] [2024-10-13 16:01:28,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672073057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:01:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974716241] [2024-10-13 16:01:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:01:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:01:28,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:28,560 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,574 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-10-13 16:01:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:01:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-13 16:01:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,575 INFO L225 Difference]: With dead ends: 30 [2024-10-13 16:01:28,575 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 16:01:28,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:28,576 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 16:01:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-13 16:01:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 16:01:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-13 16:01:28,580 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2024-10-13 16:01:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,581 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-13 16:01:28,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-13 16:01:28,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 16:01:28,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:28,585 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 16:01:28,586 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:28,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:28,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2061737047, now seen corresponding path program 1 times [2024-10-13 16:01:28,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 16:01:28,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099305551] [2024-10-13 16:01:28,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:28,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 16:01:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-13 16:01:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 16:01:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-13 16:01:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 16:01:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099305551] [2024-10-13 16:01:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099305551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:28,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:01:28,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063148588] [2024-10-13 16:01:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:28,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:01:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 16:01:28,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:01:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:01:28,679 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:28,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:28,728 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2024-10-13 16:01:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:01:28,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-10-13 16:01:28,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:28,729 INFO L225 Difference]: With dead ends: 26 [2024-10-13 16:01:28,729 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 16:01:28,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:01:28,730 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:28,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 16:01:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 16:01:28,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:01:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 16:01:28,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2024-10-13 16:01:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:28,735 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:01:28,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:28,735 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:01:28,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 16:01:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 16:01:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 16:01:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 16:01:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 16:01:28,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 16:01:28,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 16:01:28,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 16:01:28,916 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:01:28,937 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-13 16:01:28,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:28,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-13 16:01:28,938 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 16:01:28,939 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:28,940 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-13 16:01:28,940 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:28,940 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-13 16:01:28,940 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 16:01:28,940 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:28,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:01:28 BoogieIcfgContainer [2024-10-13 16:01:28,941 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:01:28,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:01:28,942 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:01:28,942 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:01:28,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:27" (3/4) ... [2024-10-13 16:01:28,944 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 16:01:28,946 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 16:01:28,947 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 16:01:28,947 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-13 16:01:28,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 16:01:28,950 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 16:01:28,951 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 16:01:28,980 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 16:01:28,983 INFO L158 Benchmark]: Toolchain (without parser) took 2728.26ms. Allocated memory is still 197.1MB. Free memory was 162.0MB in the beginning and 154.2MB in the end (delta: 7.8MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,983 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:01:28,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.32ms. Allocated memory is still 197.1MB. Free memory was 161.0MB in the beginning and 95.3MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.56ms. Allocated memory is still 197.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,984 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 197.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,984 INFO L158 Benchmark]: RCFGBuilder took 326.73ms. Allocated memory is still 197.1MB. Free memory was 91.1MB in the beginning and 74.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,984 INFO L158 Benchmark]: TraceAbstraction took 1425.36ms. Allocated memory is still 197.1MB. Free memory was 74.3MB in the beginning and 157.4MB in the end (delta: -83.1MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,984 INFO L158 Benchmark]: Witness Printer took 40.92ms. Allocated memory is still 197.1MB. Free memory was 157.4MB in the beginning and 154.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:01:28,985 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 121.6MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 835.32ms. Allocated memory is still 197.1MB. Free memory was 161.0MB in the beginning and 95.3MB in the end (delta: 65.7MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.56ms. Allocated memory is still 197.1MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 197.1MB. Free memory was 93.2MB in the beginning and 91.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 326.73ms. Allocated memory is still 197.1MB. Free memory was 91.1MB in the beginning and 74.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1425.36ms. Allocated memory is still 197.1MB. Free memory was 74.3MB in the beginning and 157.4MB in the end (delta: -83.1MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 40.92ms. Allocated memory is still 197.1MB. Free memory was 157.4MB in the beginning and 154.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset * 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 - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 543 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 153 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=1, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 178 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 5/5 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~int~TO~VOID Derived contract for procedure ##fun~int~TO~VOID. Requires: (((\old() + 2147483648) <= 0) || (((long) 2 + \old()) == 0)) Ensures: (((\old() + 2147483648) <= 0) || (((long) 2 + \old()) == 0)) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-13 16:01:29,011 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 19fc5eb310da36e5af41d4081d388b8003853571831bd141ebfde225d7512722 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 16:01:31,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 16:01:31,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Bitvector.epf [2024-10-13 16:01:31,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 16:01:31,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 16:01:31,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-10-13 16:01:31,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 16:01:31,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 16:01:31,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 16:01:31,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 16:01:31,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 16:01:31,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 16:01:31,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 16:01:31,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 16:01:31,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 16:01:31,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 16:01:31,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 16:01:31,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 16:01:31,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 16:01:31,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 16:01:31,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 16:01:31,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 16:01:31,597 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 16:01:31,598 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 16:01:31,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 16:01:31,600 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-13 16:01:31,600 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 16:01:31,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 16:01:31,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 16:01:31,601 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 16:01:31,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 16:01:31,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 16:01:31,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 16:01:31,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 16:01:31,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:01:31,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 16:01:31,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 16:01:31,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 16:01:31,604 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 16:01:31,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 16:01:31,605 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19fc5eb310da36e5af41d4081d388b8003853571831bd141ebfde225d7512722 [2024-10-13 16:01:31,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 16:01:31,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 16:01:31,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 16:01:31,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 16:01:31,885 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 16:01:31,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:33,382 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 16:01:33,686 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 16:01:33,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:33,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ea1c57b/15cd544f9402401b975ce756d24105e5/FLAG6301ec621 [2024-10-13 16:01:33,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1ea1c57b/15cd544f9402401b975ce756d24105e5 [2024-10-13 16:01:33,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 16:01:33,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 16:01:33,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 16:01:33,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 16:01:33,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 16:01:33,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:33" (1/1) ... [2024-10-13 16:01:33,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432cf01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:33, skipping insertion in model container [2024-10-13 16:01:33,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:01:33" (1/1) ... [2024-10-13 16:01:33,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 16:01:34,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:01:34,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 16:01:34,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 16:01:34,621 INFO L204 MainTranslator]: Completed translation [2024-10-13 16:01:34,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34 WrapperNode [2024-10-13 16:01:34,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 16:01:34,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 16:01:34,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 16:01:34,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 16:01:34,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,666 INFO L138 Inliner]: procedures = 507, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 67 [2024-10-13 16:01:34,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 16:01:34,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 16:01:34,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 16:01:34,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 16:01:34,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,687 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-13 16:01:34,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 16:01:34,700 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 16:01:34,700 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 16:01:34,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 16:01:34,701 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (1/1) ... [2024-10-13 16:01:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 16:01:34,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 16:01:34,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 16:01:34,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 16:01:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-13 16:01:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-13 16:01:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-13 16:01:34,777 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-13 16:01:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 16:01:34,777 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~C_INT~TO~VOID [2024-10-13 16:01:34,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~C_INT~TO~VOID [2024-10-13 16:01:34,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 16:01:34,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 16:01:34,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 16:01:34,903 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 16:01:35,052 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-13 16:01:35,052 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 16:01:35,085 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 16:01:35,086 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 16:01:35,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:35 BoogieIcfgContainer [2024-10-13 16:01:35,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 16:01:35,088 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 16:01:35,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 16:01:35,091 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 16:01:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:01:33" (1/3) ... [2024-10-13 16:01:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d88c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:35, skipping insertion in model container [2024-10-13 16:01:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:01:34" (2/3) ... [2024-10-13 16:01:35,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d88c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:01:35, skipping insertion in model container [2024-10-13 16:01:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:35" (3/3) ... [2024-10-13 16:01:35,093 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_44_good.i [2024-10-13 16:01:35,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 16:01:35,106 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 16:01:35,161 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 16:01:35,166 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;@13e88b3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 16:01:35,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 16:01:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-13 16:01:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 16:01:35,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:35,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:35,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:35,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:35,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1877852356, now seen corresponding path program 1 times [2024-10-13 16:01:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:01:35,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551451118] [2024-10-13 16:01:35,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:35,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:35,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:01:35,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 16:01:35,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 16:01:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:35,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:01:35,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:01:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:35,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:01:35,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:01:35,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551451118] [2024-10-13 16:01:35,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551451118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 16:01:35,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884468776] [2024-10-13 16:01:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:35,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:01:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:01:35,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:01:35,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:01:35,432 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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) [2024-10-13 16:01:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:35,541 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-10-13 16:01:35,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:01:35,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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 11 [2024-10-13 16:01:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:35,549 INFO L225 Difference]: With dead ends: 54 [2024-10-13 16:01:35,549 INFO L226 Difference]: Without dead ends: 36 [2024-10-13 16:01:35,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:01:35,555 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 16 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:35,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 144 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 16:01:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-13 16:01:35,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-13 16:01:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 16:01:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-10-13 16:01:35,587 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2024-10-13 16:01:35,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:35,588 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-10-13 16:01:35,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 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) [2024-10-13 16:01:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-10-13 16:01:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 16:01:35,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:35,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:35,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 16:01:35,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:35,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:35,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1916135875, now seen corresponding path program 1 times [2024-10-13 16:01:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:01:35,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564478105] [2024-10-13 16:01:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:35,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:35,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:01:35,796 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 16:01:35,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 16:01:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:35,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 16:01:35,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:01:35,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:35,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:01:35,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:01:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564478105] [2024-10-13 16:01:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564478105] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:35,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:35,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:01:35,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180997883] [2024-10-13 16:01:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:01:35,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:01:35,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:01:35,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:35,902 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 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) [2024-10-13 16:01:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:35,941 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-13 16:01:35,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:01:35,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 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 12 [2024-10-13 16:01:35,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:35,946 INFO L225 Difference]: With dead ends: 52 [2024-10-13 16:01:35,946 INFO L226 Difference]: Without dead ends: 27 [2024-10-13 16:01:35,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:35,948 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:35,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 47 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-13 16:01:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-13 16:01:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 16:01:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-13 16:01:35,953 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 12 [2024-10-13 16:01:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:35,960 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-13 16:01:35,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 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) [2024-10-13 16:01:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-13 16:01:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 16:01:35,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:35,961 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:35,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 16:01:36,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:36,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:36,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:36,163 INFO L85 PathProgramCache]: Analyzing trace with hash 158570356, now seen corresponding path program 1 times [2024-10-13 16:01:36,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:01:36,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554787986] [2024-10-13 16:01:36,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:36,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:36,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:01:36,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 16:01:36,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 16:01:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:36,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 16:01:36,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:01:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:36,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:01:36,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:01:36,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554787986] [2024-10-13 16:01:36,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554787986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:36,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:36,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 16:01:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942550189] [2024-10-13 16:01:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:36,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 16:01:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:01:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 16:01:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:36,264 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:36,287 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-13 16:01:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 16:01:36,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-10-13 16:01:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:36,288 INFO L225 Difference]: With dead ends: 27 [2024-10-13 16:01:36,288 INFO L226 Difference]: Without dead ends: 25 [2024-10-13 16:01:36,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 16:01:36,290 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 3 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:36,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-13 16:01:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 16:01:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-13 16:01:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-10-13 16:01:36,295 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2024-10-13 16:01:36,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:36,295 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-10-13 16:01:36,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:36,296 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-10-13 16:01:36,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 16:01:36,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 16:01:36,297 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 16:01:36,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 16:01:36,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:36,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-10-13 16:01:36,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 16:01:36,499 INFO L85 PathProgramCache]: Analyzing trace with hash 620696973, now seen corresponding path program 1 times [2024-10-13 16:01:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 16:01:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463736659] [2024-10-13 16:01:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 16:01:36,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:36,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 16:01:36,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 16:01:36,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 16:01:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 16:01:36,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 16:01:36,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 16:01:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 16:01:36,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 16:01:36,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 16:01:36,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463736659] [2024-10-13 16:01:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463736659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 16:01:36,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 16:01:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 16:01:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17772375] [2024-10-13 16:01:36,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 16:01:36,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 16:01:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 16:01:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 16:01:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 16:01:36,618 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 16:01:36,653 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-10-13 16:01:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 16:01:36,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2024-10-13 16:01:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 16:01:36,654 INFO L225 Difference]: With dead ends: 25 [2024-10-13 16:01:36,654 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 16:01:36,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 16:01:36,655 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 16:01:36,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 16:01:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 16:01:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 16:01:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 16:01:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 16:01:36,656 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2024-10-13 16:01:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 16:01:36,657 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 16:01:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 16:01:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 16:01:36,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 16:01:36,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-13 16:01:36,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-13 16:01:36,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-13 16:01:36,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~C_INT~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-13 16:01:36,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 16:01:36,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 16:01:36,863 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 16:01:36,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 16:01:36,990 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 16:01:37,013 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:37,014 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset [2024-10-13 16:01:37,014 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:37,015 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-13 16:01:37,015 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 16:01:37,015 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-13 16:01:37,015 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:37,016 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset [2024-10-13 16:01:37,016 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-13 16:01:37,016 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset [2024-10-13 16:01:37,016 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-13 16:01:37,016 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base [2024-10-13 16:01:37,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:01:37 BoogieIcfgContainer [2024-10-13 16:01:37,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 16:01:37,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 16:01:37,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 16:01:37,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 16:01:37,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:01:35" (3/4) ... [2024-10-13 16:01:37,019 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 16:01:37,022 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-13 16:01:37,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-13 16:01:37,023 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~C_INT~TO~VOID [2024-10-13 16:01:37,026 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-10-13 16:01:37,026 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 16:01:37,026 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-13 16:01:37,026 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 16:01:37,056 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.witnessprinter has thrown an exception: java.lang.NullPointerException at java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitnessLocation(YamlCorrectnessWitnessGenerator.java:111) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.extractFunctionContracts(YamlCorrectnessWitnessGenerator.java:104) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.getWitness(YamlCorrectnessWitnessGenerator.java:66) at de.uni_freiburg.informatik.ultimate.witnessprinter.yaml.YamlCorrectnessWitnessGenerator.makeYamlString(YamlCorrectnessWitnessGenerator.java:116) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.generateProofWitness(WitnessPrinter.java:170) at de.uni_freiburg.informatik.ultimate.witnessprinter.WitnessPrinter.finish(WitnessPrinter.java:140) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:130) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 16:01:37,059 INFO L158 Benchmark]: Toolchain (without parser) took 3330.99ms. Allocated memory was 65.0MB in the beginning and 107.0MB in the end (delta: 41.9MB). Free memory was 33.9MB in the beginning and 61.8MB in the end (delta: -27.8MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,059 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 48.2MB. Free memory is still 21.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 16:01:37,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 893.28ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 33.8MB in the beginning and 38.5MB in the end (delta: -4.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.36ms. Allocated memory is still 79.7MB. Free memory was 38.5MB in the beginning and 35.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,059 INFO L158 Benchmark]: Boogie Preprocessor took 32.75ms. Allocated memory is still 79.7MB. Free memory was 35.2MB in the beginning and 32.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,060 INFO L158 Benchmark]: RCFGBuilder took 385.96ms. Allocated memory is still 79.7MB. Free memory was 32.7MB in the beginning and 36.1MB in the end (delta: -3.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,060 INFO L158 Benchmark]: TraceAbstraction took 1928.94ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 35.7MB in the beginning and 64.6MB in the end (delta: -28.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,060 INFO L158 Benchmark]: Witness Printer took 41.15ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 61.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 16:01:37,061 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.17ms. Allocated memory is still 48.2MB. Free memory is still 21.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 893.28ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 33.8MB in the beginning and 38.5MB in the end (delta: -4.7MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.36ms. Allocated memory is still 79.7MB. Free memory was 38.5MB in the beginning and 35.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.75ms. Allocated memory is still 79.7MB. Free memory was 35.2MB in the beginning and 32.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 385.96ms. Allocated memory is still 79.7MB. Free memory was 32.7MB in the beginning and 36.1MB in the end (delta: -3.4MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1928.94ms. Allocated memory was 79.7MB in the beginning and 107.0MB in the end (delta: 27.3MB). Free memory was 35.7MB in the beginning and 64.6MB in the end (delta: -28.9MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. * Witness Printer took 41.15ms. Allocated memory is still 107.0MB. Free memory was 64.6MB in the beginning and 61.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodG2BSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~goodB2GSink.base * 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 - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1568]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1551]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 240 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 88 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 116 SizeOfPredicates, 3 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 5/5 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - ProcedureContractResult [Line: -1]: Procedure Contract for ##fun~C_INT~TO~VOID Derived contract for procedure ##fun~C_INT~TO~VOID. Requires: ((0 == ((2 + \old()) % 4294967296)) || (-2147483648 == \old())) Ensures: ((0 == ((2 + \old()) % 4294967296)) || (-2147483648 == \old())) * Results from de.uni_freiburg.informatik.ultimate.witnessprinter: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.witnessprinter: NullPointerException: null: java.base/java.util.ImmutableCollections$Map1.get(ImmutableCollections.java:759) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-13 16:01:37,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null