./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'fd71e81526c53a209c01167c5f9fb82334550a28a2ce7544b173ad186de6362e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd71e81526c53a209c01167c5f9fb82334550a28a2ce7544b173ad186de6362e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:31:24,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:31:24,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:31:24,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:31:24,817 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:31:24,841 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:31:24,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:31:24,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:31:24,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:31:24,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:31:24,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:31:24,843 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:31:24,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:31:24,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:31:24,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:31:24,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:31:24,846 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:31:24,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:31:24,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:31:24,846 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:31:24,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:31:24,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:31:24,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:31:24,847 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd71e81526c53a209c01167c5f9fb82334550a28a2ce7544b173ad186de6362e [2024-11-07 20:31:25,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:31:25,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:31:25,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:31:25,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:31:25,060 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:31:25,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound1.c [2024-11-07 20:31:26,202 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:31:26,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:31:26,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u2_unwindbound1.c [2024-11-07 20:31:26,439 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d95457772/f6979988342d4bb480d99d3a1e23f306/FLAGda4d8b3a2 [2024-11-07 20:31:26,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d95457772/f6979988342d4bb480d99d3a1e23f306 [2024-11-07 20:31:26,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:31:26,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:31:26,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:31:26,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:31:26,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:31:26,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e53620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26, skipping insertion in model container [2024-11-07 20:31:26,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,812 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:31:26,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:31:26,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:31:26,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:31:26,942 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:31:26,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26 WrapperNode [2024-11-07 20:31:26,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:31:26,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:31:26,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:31:26,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:31:26,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,964 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-11-07 20:31:26,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:31:26,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:31:26,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:31:26,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:31:26,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,991 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 20:31:26,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:26,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:31:26,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:31:26,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:31:26,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:31:26,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (1/1) ... [2024-11-07 20:31:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:31:27,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:31:27,019 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 20:31:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 20:31:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:31:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:31:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:31:27,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:31:27,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:31:27,037 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:31:27,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:31:27,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:31:27,332 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2024-11-07 20:31:27,332 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:31:27,341 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:31:27,342 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 20:31:27,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:27 BoogieIcfgContainer [2024-11-07 20:31:27,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:31:27,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:31:27,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:31:27,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:31:27,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:31:26" (1/3) ... [2024-11-07 20:31:27,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7ef838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:27, skipping insertion in model container [2024-11-07 20:31:27,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:31:26" (2/3) ... [2024-11-07 20:31:27,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7ef838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:31:27, skipping insertion in model container [2024-11-07 20:31:27,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:27" (3/3) ... [2024-11-07 20:31:27,350 INFO L112 eAbstractionObserver]: Analyzing ICFG geo1-u2_unwindbound1.c [2024-11-07 20:31:27,361 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:31:27,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-07 20:31:27,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:31:27,408 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;@7f25c6cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:31:27,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-07 20:31:27,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 20:31:27,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:27,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 20:31:27,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:27,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:27,421 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-07 20:31:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:27,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124795276] [2024-11-07 20:31:27,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:27,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124795276] [2024-11-07 20:31:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124795276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:27,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:31:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941221066] [2024-11-07 20:31:27,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:27,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:31:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:27,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:31:27,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:27,585 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-07 20:31:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:27,636 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2024-11-07 20:31:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:31:27,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Word has length 4 [2024-11-07 20:31:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:27,641 INFO L225 Difference]: With dead ends: 126 [2024-11-07 20:31:27,642 INFO L226 Difference]: Without dead ends: 57 [2024-11-07 20:31:27,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:31:27,645 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:27,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 116 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:31:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-07 20:31:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-07 20:31:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.75) internal successors, (56), 54 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2024-11-07 20:31:27,680 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 4 [2024-11-07 20:31:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:27,680 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2024-11-07 20:31:27,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-11-07 20:31:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2024-11-07 20:31:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 20:31:27,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:27,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 20:31:27,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:31:27,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:27,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:27,682 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-07 20:31:27,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:27,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040299409] [2024-11-07 20:31:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:27,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040299409] [2024-11-07 20:31:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040299409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:27,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:27,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:31:27,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123164571] [2024-11-07 20:31:27,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:27,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:31:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:27,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:31:27,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:27,712 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-11-07 20:31:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:27,744 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2024-11-07 20:31:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:31:27,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2024-11-07 20:31:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:27,745 INFO L225 Difference]: With dead ends: 74 [2024-11-07 20:31:27,745 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 20:31:27,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:31:27,746 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:27,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:31:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 20:31:27,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-07 20:31:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 58 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2024-11-07 20:31:27,750 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 5 [2024-11-07 20:31:27,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:27,750 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2024-11-07 20:31:27,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-11-07 20:31:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2024-11-07 20:31:27,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 20:31:27,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:27,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:27,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:31:27,751 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:27,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:27,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1806812487, now seen corresponding path program 1 times [2024-11-07 20:31:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317644969] [2024-11-07 20:31:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:27,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:31:27,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1473790128] [2024-11-07 20:31:27,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:27,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:27,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:31:27,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:31:27,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 20:31:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:27,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:31:27,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:31:27,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:27,817 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:31:27,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:27,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317644969] [2024-11-07 20:31:27,818 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:31:27,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473790128] [2024-11-07 20:31:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473790128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:31:27,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444815136] [2024-11-07 20:31:27,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:27,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:31:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:27,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:31:27,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:31:27,819 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-07 20:31:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:27,890 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-07 20:31:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:31:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 7 [2024-11-07 20:31:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:27,891 INFO L225 Difference]: With dead ends: 91 [2024-11-07 20:31:27,891 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 20:31:27,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:31:27,892 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:27,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 62 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:31:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 20:31:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-07 20:31:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5849056603773586) internal successors, (84), 75 states have internal predecessors, (84), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-07 20:31:27,897 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 7 [2024-11-07 20:31:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:27,897 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-07 20:31:27,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-11-07 20:31:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-07 20:31:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 20:31:27,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:27,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:27,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 20:31:28,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:28,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:28,103 INFO L85 PathProgramCache]: Analyzing trace with hash 122113611, now seen corresponding path program 1 times [2024-11-07 20:31:28,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:28,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329911003] [2024-11-07 20:31:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:28,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:31:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1802956934] [2024-11-07 20:31:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:28,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:28,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:31:28,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:31:28,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 20:31:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:31:28,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:31:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:28,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:31:28,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329911003] [2024-11-07 20:31:28,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:31:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802956934] [2024-11-07 20:31:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802956934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:31:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299364354] [2024-11-07 20:31:28,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:28,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:31:28,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:31:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:31:28,207 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 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-11-07 20:31:28,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:28,281 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-07 20:31:28,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:31:28,282 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), 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) Word has length 11 [2024-11-07 20:31:28,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:28,282 INFO L225 Difference]: With dead ends: 83 [2024-11-07 20:31:28,282 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 20:31:28,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:31:28,283 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:28,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:31:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 20:31:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-07 20:31:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 75 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2024-11-07 20:31:28,288 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 11 [2024-11-07 20:31:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:28,288 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2024-11-07 20:31:28,288 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), 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-11-07 20:31:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2024-11-07 20:31:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 20:31:28,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:28,289 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:28,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 20:31:28,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:28,493 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:28,494 INFO L85 PathProgramCache]: Analyzing trace with hash -509445297, now seen corresponding path program 1 times [2024-11-07 20:31:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086920243] [2024-11-07 20:31:28,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:28,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:28,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086920243] [2024-11-07 20:31:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086920243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:31:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925499183] [2024-11-07 20:31:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:28,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:31:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:31:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:28,581 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-07 20:31:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:28,647 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-07 20:31:28,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:31:28,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 12 [2024-11-07 20:31:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:28,648 INFO L225 Difference]: With dead ends: 83 [2024-11-07 20:31:28,648 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 20:31:28,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:28,649 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:28,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:31:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 20:31:28,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2024-11-07 20:31:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.509433962264151) internal successors, (80), 75 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-07 20:31:28,655 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 12 [2024-11-07 20:31:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-07 20:31:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-11-07 20:31:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-07 20:31:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 20:31:28,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:28,656 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:28,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:31:28,656 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1343722417, now seen corresponding path program 1 times [2024-11-07 20:31:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904235385] [2024-11-07 20:31:28,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:31:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:28,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:28,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904235385] [2024-11-07 20:31:28,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904235385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:28,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:31:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95959087] [2024-11-07 20:31:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:28,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:31:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:28,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:31:28,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:31:28,744 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:28,757 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-07 20:31:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:31:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-07 20:31:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:28,758 INFO L225 Difference]: With dead ends: 81 [2024-11-07 20:31:28,758 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 20:31:28,758 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-11-07 20:31:28,759 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:28,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:31:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 20:31:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 20:31:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2024-11-07 20:31:28,763 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 21 [2024-11-07 20:31:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:28,764 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2024-11-07 20:31:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2024-11-07 20:31:28,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-07 20:31:28,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:28,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:28,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 20:31:28,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1467951768, now seen corresponding path program 1 times [2024-11-07 20:31:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142971724] [2024-11-07 20:31:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:28,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:31:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:28,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142971724] [2024-11-07 20:31:28,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142971724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:28,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:28,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:31:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624759329] [2024-11-07 20:31:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:28,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:31:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:31:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:28,825 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:29,842 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2024-11-07 20:31:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:31:29,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-07 20:31:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:29,844 INFO L225 Difference]: With dead ends: 79 [2024-11-07 20:31:29,844 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 20:31:29,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:31:29,845 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 42 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:29,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 76 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 20:31:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 20:31:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-07 20:31:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2024-11-07 20:31:29,856 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 23 [2024-11-07 20:31:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2024-11-07 20:31:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:29,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2024-11-07 20:31:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 20:31:29,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:29,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:29,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:31:29,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:29,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:29,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1738135543, now seen corresponding path program 1 times [2024-11-07 20:31:29,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:29,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846938187] [2024-11-07 20:31:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:31:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1917508142] [2024-11-07 20:31:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:31:29,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:31:29,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 20:31:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:29,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:31:29,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:31:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:29,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:31:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846938187] [2024-11-07 20:31:29,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:31:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917508142] [2024-11-07 20:31:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917508142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:31:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743718570] [2024-11-07 20:31:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:31:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:29,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:31:29,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:29,980 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:31:30,085 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-11-07 20:31:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:31:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-07 20:31:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:31:30,086 INFO L225 Difference]: With dead ends: 83 [2024-11-07 20:31:30,086 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 20:31:30,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:31:30,087 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:31:30,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:31:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 20:31:30,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-07 20:31:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:31:30,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-07 20:31:30,092 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 24 [2024-11-07 20:31:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:31:30,096 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-07 20:31:30,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-07 20:31:30,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 20:31:30,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:31:30,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:31:30,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 20:31:30,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:31:30,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:31:30,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:31:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1952372918, now seen corresponding path program 1 times [2024-11-07 20:31:30,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:31:30,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075803499] [2024-11-07 20:31:30,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:31:30,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:31:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:36,122 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-07 20:31:40,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:31:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:31:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:31:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:31:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075803499] [2024-11-07 20:31:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075803499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:31:44,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:31:44,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 20:31:44,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415039747] [2024-11-07 20:31:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:31:44,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 20:31:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:31:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 20:31:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-11-07 20:31:44,641 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:31:54,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:31:56,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:00,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:04,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:06,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:09,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:13,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:15,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:20,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:24,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:26,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:30,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:33,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:36,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:38,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:42,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:44,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:53,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:32:55,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:00,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:02,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:06,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:11,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:33:11,454 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2024-11-07 20:33:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 20:33:11,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-11-07 20:33:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:33:11,455 INFO L225 Difference]: With dead ends: 89 [2024-11-07 20:33:11,455 INFO L226 Difference]: Without dead ends: 88 [2024-11-07 20:33:11,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-11-07 20:33:11,455 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 86 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 13 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:33:11,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 88 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 231 Invalid, 11 Unknown, 0 Unchecked, 76.4s Time] [2024-11-07 20:33:11,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-07 20:33:11,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2024-11-07 20:33:11,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.45) internal successors, (87), 81 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:33:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-07 20:33:11,461 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 25 [2024-11-07 20:33:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:33:11,461 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-07 20:33:11,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:33:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-07 20:33:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 20:33:11,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:33:11,462 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:33:11,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 20:33:11,462 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:33:11,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:33:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash -394018215, now seen corresponding path program 1 times [2024-11-07 20:33:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:33:11,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136094630] [2024-11-07 20:33:11,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:33:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:33:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:33:11,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-07 20:33:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:33:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:33:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:33:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136094630] [2024-11-07 20:33:11,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136094630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:33:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:33:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:33:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498102560] [2024-11-07 20:33:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:33:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:33:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:33:11,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:33:11,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:33:11,500 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:33:15,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-07 20:33:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:33:15,620 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2024-11-07 20:33:15,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:33:15,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-11-07 20:33:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:33:15,621 INFO L225 Difference]: With dead ends: 85 [2024-11-07 20:33:15,621 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 20:33:15,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:33:15,622 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:33:15,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 20:33:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 20:33:15,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 20:33:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 73 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:33:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2024-11-07 20:33:15,627 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 26 [2024-11-07 20:33:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:33:15,627 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2024-11-07 20:33:15,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:33:15,627 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2024-11-07 20:33:15,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 20:33:15,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:33:15,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:33:15,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 20:33:15,628 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 20:33:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:33:15,628 INFO L85 PathProgramCache]: Analyzing trace with hash 987234621, now seen corresponding path program 1 times [2024-11-07 20:33:15,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:33:15,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048019028] [2024-11-07 20:33:15,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:33:15,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:33:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:33:15,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [328173515] [2024-11-07 20:33:15,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:33:15,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:33:15,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:33:15,637 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:33:15,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 20:33:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 20:33:15,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 20:33:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 20:33:15,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 20:33:15,695 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 20:33:15,695 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 24 remaining) [2024-11-07 20:33:15,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2024-11-07 20:33:15,698 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2024-11-07 20:33:15,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:33:15,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 20:33:15,901 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:33:15,919 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:33:15,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:33:15 BoogieIcfgContainer [2024-11-07 20:33:15,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:33:15,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:33:15,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:33:15,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:33:15,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:31:27" (3/4) ... [2024-11-07 20:33:15,925 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 20:33:15,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:33:15,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:33:15,956 INFO L158 Benchmark]: Toolchain (without parser) took 109165.08ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 92.8MB in the beginning and 56.4MB in the end (delta: 36.4MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2024-11-07 20:33:15,956 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:33:15,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.85ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:33:15,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.61ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:33:15,957 INFO L158 Benchmark]: Boogie Preprocessor took 31.58ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:33:15,957 INFO L158 Benchmark]: RCFGBuilder took 346.02ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 63.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:33:15,957 INFO L158 Benchmark]: TraceAbstraction took 108578.56ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 63.2MB in the beginning and 58.4MB in the end (delta: 4.8MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-07 20:33:15,957 INFO L158 Benchmark]: Witness Printer took 31.70ms. Allocated memory is still 159.4MB. Free memory was 58.4MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:33:15,958 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.92ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.85ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 81.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.61ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 80.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.58ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 346.02ms. Allocated memory is still 117.4MB. Free memory was 78.9MB in the beginning and 63.9MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 108578.56ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 63.2MB in the beginning and 58.4MB in the end (delta: 4.8MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 31.70ms. Allocated memory is still 159.4MB. Free memory was 58.4MB in the beginning and 56.4MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: integer overflow possible integer overflow possible We found a FailurePath: [L22] int counter = 0; VAL [counter=0] [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 VAL [c=1, counter=0, x=1, y=3037000500, z=7331967796] [L33] EXPR counter++ VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L33] COND TRUE counter++<1 [L34] EXPR x*z VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x - y VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] EXPR x*z - x - y + 1 VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, counter=1, x=1, y=3037000500, z=7331967796] [L36] COND FALSE !(!(c < k)) VAL [c=1, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L39] EXPR c + 1 [L39] c = c + 1 VAL [c=2, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L40] EXPR x * z VAL [c=2, counter=1, k=2, x=1, y=3037000500, z=7331967796] [L40] EXPR x * z + 1 [L40] x = x * z + 1 VAL [c=2, counter=1, k=2, x=3037000501, y=3037000500, z=7331967796] [L41] y * z VAL [c=2, counter=1, k=2, x=3037000501] - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 65 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 108.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 92.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 81.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 863 SdHoareTripleChecker+Invalid, 81.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 445 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 666 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 418 mSDtfsCounter, 666 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 20:33:15,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)