./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_multiply_65_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c15a5d9ed6c99b9148fde2a2ab29546ac594b5e1ca2f47e1f10c13f23b83e3df --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:15:01,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:15:01,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:15:01,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:15:01,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:15:01,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:15:01,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:15:01,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:15:01,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:15:01,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:15:01,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:15:01,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:15:01,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:15:01,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:15:01,390 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:15:01,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:15:01,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:15:01,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:15:01,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:15:01,392 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:15:01,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:15:01,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:15:01,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:15:01,393 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:15:01,393 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:15:01,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:15:01,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:15:01,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:15:01,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:15:01,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:15:01,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:15:01,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:01,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:15:01,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:15:01,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:15:01,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:15:01,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:15:01,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:15:01,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:15:01,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:15:01,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:15:01,398 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-clean/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-clean/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 -> c15a5d9ed6c99b9148fde2a2ab29546ac594b5e1ca2f47e1f10c13f23b83e3df [2024-10-11 23:15:01,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:15:01,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:15:01,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:15:01,601 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:15:01,602 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:15:01,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i [2024-10-11 23:15:02,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:15:03,204 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:15:03,204 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_multiply_65_good.i [2024-10-11 23:15:03,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97fe1e39c/15315ee3c9314621b4f751aae5d0d03f/FLAGd55f78cd8 [2024-10-11 23:15:03,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/97fe1e39c/15315ee3c9314621b4f751aae5d0d03f [2024-10-11 23:15:03,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:15:03,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:15:03,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:03,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:15:03,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:15:03,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:03" (1/1) ... [2024-10-11 23:15:03,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5501dfc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:03, skipping insertion in model container [2024-10-11 23:15:03,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:15:03" (1/1) ... [2024-10-11 23:15:03,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:15:03,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:03,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:15:03,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:15:04,053 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:15:04,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04 WrapperNode [2024-10-11 23:15:04,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:15:04,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:04,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:15:04,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:15:04,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,141 INFO L138 Inliner]: procedures = 502, calls = 32, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 63 [2024-10-11 23:15:04,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:15:04,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:15:04,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:15:04,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:15:04,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,185 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:15:04,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:15:04,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:15:04,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:15:04,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:15:04,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (1/1) ... [2024-10-11 23:15:04,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:15:04,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:15:04,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 23:15:04,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 23:15:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:15:04,313 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:15:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:15:04,313 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:15:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:15:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2024-10-11 23:15:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2024-10-11 23:15:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:15:04,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:15:04,414 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:15:04,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:15:04,499 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 23:15:04,499 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:15:04,526 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:15:04,528 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:15:04,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:04 BoogieIcfgContainer [2024-10-11 23:15:04,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:15:04,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:15:04,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:15:04,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:15:04,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:15:03" (1/3) ... [2024-10-11 23:15:04,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a37a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:04, skipping insertion in model container [2024-10-11 23:15:04,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:15:04" (2/3) ... [2024-10-11 23:15:04,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a37a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:15:04, skipping insertion in model container [2024-10-11 23:15:04,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:04" (3/3) ... [2024-10-11 23:15:04,535 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_multiply_65_good.i [2024-10-11 23:15:04,547 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:15:04,547 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 23:15:04,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:15:04,609 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;@2cdba503, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:15:04,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 23:15:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 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-11 23:15:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 23:15:04,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:04,625 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:04,625 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-11 23:15:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1900034262, now seen corresponding path program 1 times [2024-10-11 23:15:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938999729] [2024-10-11 23:15:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:04,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:04,896 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-11 23:15:04,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:04,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938999729] [2024-10-11 23:15:04,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938999729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:04,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:04,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 23:15:04,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252917598] [2024-10-11 23:15:04,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:04,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 23:15:04,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 23:15:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:04,922 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 28 states have internal predecessors, (33), 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.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-11 23:15:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,007 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-10-11 23:15:05,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 23:15:05,011 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-11 23:15:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,017 INFO L225 Difference]: With dead ends: 62 [2024-10-11 23:15:05,017 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 23:15:05,019 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-11 23:15:05,022 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 23:15:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2024-10-11 23:15:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 34 states have internal predecessors, (42), 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-11 23:15:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-10-11 23:15:05,053 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 12 [2024-10-11 23:15:05,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,054 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-10-11 23:15:05,054 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-11 23:15:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-10-11 23:15:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 23:15:05,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:15:05,055 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-11 23:15:05,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1228480113, now seen corresponding path program 1 times [2024-10-11 23:15:05,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933664136] [2024-10-11 23:15:05,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,103 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-11 23:15:05,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933664136] [2024-10-11 23:15:05,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933664136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:15:05,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484493833] [2024-10-11 23:15:05,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:05,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:05,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:05,106 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:15:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,121 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-11 23:15:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:05,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 23:15:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,123 INFO L225 Difference]: With dead ends: 44 [2024-10-11 23:15:05,123 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 23:15:05,123 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-11 23:15:05,124 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 23:15:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 23:15:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 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-11 23:15:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-11 23:15:05,131 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 13 [2024-10-11 23:15:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-11 23:15:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:15:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-10-11 23:15:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 23:15:05,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:15:05,132 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-11 23:15:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1227772113, now seen corresponding path program 1 times [2024-10-11 23:15:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770821386] [2024-10-11 23:15:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,200 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-11 23:15:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770821386] [2024-10-11 23:15:05,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770821386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:15:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58017930] [2024-10-11 23:15:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:05,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:05,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:05,202 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:15:05,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,224 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-11 23:15:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:05,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 23:15:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,227 INFO L225 Difference]: With dead ends: 42 [2024-10-11 23:15:05,227 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 23:15:05,227 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-11 23:15:05,228 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 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-11 23:15:05,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 23:15:05,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 23:15:05,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 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-11 23:15:05,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-11 23:15:05,240 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 13 [2024-10-11 23:15:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,240 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-11 23:15:05,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 23:15:05,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-11 23:15:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 23:15:05,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:15:05,242 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-11 23:15:05,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,242 INFO L85 PathProgramCache]: Analyzing trace with hash -593770090, now seen corresponding path program 1 times [2024-10-11 23:15:05,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124735623] [2024-10-11 23:15:05,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,305 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-11 23:15:05,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124735623] [2024-10-11 23:15:05,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124735623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:15:05,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410183774] [2024-10-11 23:15:05,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:15:05,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:15:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:15:05,309 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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-11 23:15:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,326 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-11 23:15:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:15:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-11 23:15:05,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,328 INFO L225 Difference]: With dead ends: 41 [2024-10-11 23:15:05,328 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 23:15:05,328 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-11 23:15:05,329 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 23:15:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 23:15:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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-11 23:15:05,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-11 23:15:05,339 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 14 [2024-10-11 23:15:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,339 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-11 23:15:05,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (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-11 23:15:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-11 23:15:05,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 23:15:05,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,340 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:15:05,340 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-11 23:15:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,342 INFO L85 PathProgramCache]: Analyzing trace with hash -193911581, now seen corresponding path program 1 times [2024-10-11 23:15:05,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282096981] [2024-10-11 23:15:05,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,473 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-11 23:15:05,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282096981] [2024-10-11 23:15:05,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282096981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 23:15:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26883736] [2024-10-11 23:15:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 23:15:05,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 23:15:05,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:05,476 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:05,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,509 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-11 23:15:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 23:15:05,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 23:15:05,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,510 INFO L225 Difference]: With dead ends: 46 [2024-10-11 23:15:05,510 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 23:15:05,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:15:05,512 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 137 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 23:15:05,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 23:15:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 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-11 23:15:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-10-11 23:15:05,515 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2024-10-11 23:15:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,516 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-10-11 23:15:05,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-10-11 23:15:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 23:15:05,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,517 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:15:05,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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-11 23:15:05,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1818954836, now seen corresponding path program 1 times [2024-10-11 23:15:05,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872648762] [2024-10-11 23:15:05,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,606 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-11 23:15:05,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872648762] [2024-10-11 23:15:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872648762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817576731] [2024-10-11 23:15:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:05,608 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,619 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2024-10-11 23:15:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 23:15:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,620 INFO L225 Difference]: With dead ends: 45 [2024-10-11 23:15:05,620 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 23:15:05,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-11 23:15:05,621 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 90 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 23:15:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 23:15:05,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.0526315789473684) 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-11 23:15:05,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-11 23:15:05,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2024-10-11 23:15:05,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,625 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-11 23:15:05,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 23:15:05,625 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-11 23:15:05,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 23:15:05,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:15:05,626 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 23:15:05,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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-11 23:15:05,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:15:05,626 INFO L85 PathProgramCache]: Analyzing trace with hash 581587835, now seen corresponding path program 1 times [2024-10-11 23:15:05,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:15:05,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773051111] [2024-10-11 23:15:05,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:15:05,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:15:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:15:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:15:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 23:15:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:15:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 23:15:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:15:05,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773051111] [2024-10-11 23:15:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773051111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:15:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:15:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:15:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542930650] [2024-10-11 23:15:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:15:05,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:15:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:15:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:15:05,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:15:05,697 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11 23:15:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:15:05,708 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-10-11 23:15:05,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:15:05,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 26 [2024-10-11 23:15:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:15:05,709 INFO L225 Difference]: With dead ends: 27 [2024-10-11 23:15:05,709 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:15:05,709 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-11 23:15:05,710 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:15:05,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:15:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:15:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:15:05,711 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-11 23:15:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:15:05,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-10-11 23:15:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:15:05,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:15:05,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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-11 23:15:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:15:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:15:05,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-10-11 23:15:05,714 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-10-11 23:15:05,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-10-11 23:15:05,715 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ##fun~int~TO~VOIDErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-10-11 23:15:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:15:05,717 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:15:05,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:15:05,810 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:15:05,823 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset [2024-10-11 23:15:05,823 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!offset [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base [2024-10-11 23:15:05,824 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #in~#fp!base [2024-10-11 23:15:05,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:15:05 BoogieIcfgContainer [2024-10-11 23:15:05,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:15:05,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:15:05,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:15:05,825 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:15:05,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:15:04" (3/4) ... [2024-10-11 23:15:05,827 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:15:05,830 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:15:05,830 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:15:05,830 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~int~TO~VOID [2024-10-11 23:15:05,833 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2024-10-11 23:15:05,833 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 23:15:05,834 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 23:15:05,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:15:05,895 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:15:05,895 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:15:05,896 INFO L158 Benchmark]: Toolchain (without parser) took 2653.24ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 70.1MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,896 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:15:05,896 INFO L158 Benchmark]: CACSL2BoogieTranslator took 811.04ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 132.5MB in the end (delta: -8.1MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.24ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,897 INFO L158 Benchmark]: Boogie Preprocessor took 67.17ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,897 INFO L158 Benchmark]: RCFGBuilder took 315.59ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 111.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,897 INFO L158 Benchmark]: TraceAbstraction took 1295.19ms. Allocated memory is still 201.3MB. Free memory was 110.5MB in the beginning and 74.3MB in the end (delta: 36.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,898 INFO L158 Benchmark]: Witness Printer took 70.20ms. Allocated memory is still 201.3MB. Free memory was 74.3MB in the beginning and 70.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:15:05,899 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.13ms. Allocated memory is still 201.3MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 811.04ms. Allocated memory is still 201.3MB. Free memory was 124.4MB in the beginning and 132.5MB in the end (delta: -8.1MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.24ms. Allocated memory is still 201.3MB. Free memory was 131.4MB in the beginning and 129.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.17ms. Allocated memory is still 201.3MB. Free memory was 129.4MB in the beginning and 127.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 315.59ms. Allocated memory is still 201.3MB. Free memory was 127.3MB in the beginning and 111.6MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1295.19ms. Allocated memory is still 201.3MB. Free memory was 110.5MB in the beginning and 74.3MB in the end (delta: 36.2MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. * Witness Printer took 70.20ms. Allocated memory is still 201.3MB. Free memory was 74.3MB in the beginning and 70.1MB in the end (delta: 4.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~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #funAddr~CWE191_Integer_Underflow__int_min_multiply_65b_goodB2GSink.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #in~#fp!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: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1593]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: 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, 39 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 658 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 228 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 197 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 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 RESULT: Ultimate proved your program to be correct! [2024-10-11 23:15:05,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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: TRUE