./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-numeric/EvenOdd01-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-numeric/EvenOdd01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 93e64a210ad8295ef3e6c8bf5a4996e01ec752ae44f5068490e5115d4dda29b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:51,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:51,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:51,404 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:51,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:51,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:51,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:51,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:51,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:51,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:51,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:51,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:51,429 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:51,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:51,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:51,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:51,431 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93e64a210ad8295ef3e6c8bf5a4996e01ec752ae44f5068490e5115d4dda29b5 [2025-03-04 10:32:51,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:51,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:51,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:51,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:51,687 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:51,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/EvenOdd01-2.c [2025-03-04 10:32:52,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b71af64/5050c6bf170f4b05a61ad329171457b5/FLAG01c1a6b32 [2025-03-04 10:32:53,084 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:53,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/EvenOdd01-2.c [2025-03-04 10:32:53,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b71af64/5050c6bf170f4b05a61ad329171457b5/FLAG01c1a6b32 [2025-03-04 10:32:53,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38b71af64/5050c6bf170f4b05a61ad329171457b5 [2025-03-04 10:32:53,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:53,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:53,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:53,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:53,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:53,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c2aa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53, skipping insertion in model container [2025-03-04 10:32:53,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:53,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:53,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:53,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:53,279 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:53,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53 WrapperNode [2025-03-04 10:32:53,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:53,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:53,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:53,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:53,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,301 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2025-03-04 10:32:53,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:53,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:53,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:53,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:53,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,318 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:32:53,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,321 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:53,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:53,326 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:53,326 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:53,327 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (1/1) ... [2025-03-04 10:32:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:53,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:53,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:32:53,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:32:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:32:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2025-03-04 10:32:53,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2025-03-04 10:32:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:32:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2025-03-04 10:32:53,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2025-03-04 10:32:53,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:53,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:53,416 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:53,417 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:53,457 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc #t~ret5; [2025-03-04 10:32:53,475 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2025-03-04 10:32:53,501 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:53,501 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:53,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:53,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:53,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:53 BoogieIcfgContainer [2025-03-04 10:32:53,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:53,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:53,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:53,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:53,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:53" (1/3) ... [2025-03-04 10:32:53,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c58be86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:53, skipping insertion in model container [2025-03-04 10:32:53,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:53" (2/3) ... [2025-03-04 10:32:53,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c58be86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:53, skipping insertion in model container [2025-03-04 10:32:53,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:53" (3/3) ... [2025-03-04 10:32:53,515 INFO L128 eAbstractionObserver]: Analyzing ICFG EvenOdd01-2.c [2025-03-04 10:32:53,525 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:53,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG EvenOdd01-2.c that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-04 10:32:53,555 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:53,564 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;@5a5e7717, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:53,565 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:32:53,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:32:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 10:32:53,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:53,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:53,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:53,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -455251194, now seen corresponding path program 1 times [2025-03-04 10:32:53,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:53,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551495178] [2025-03-04 10:32:53,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:53,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:53,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 10:32:53,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 10:32:53,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:53,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551495178] [2025-03-04 10:32:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551495178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:53,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:53,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087613256] [2025-03-04 10:32:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:53,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:53,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:53,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:53,751 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:53,820 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2025-03-04 10:32:53,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 10:32:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:53,825 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:32:53,826 INFO L226 Difference]: Without dead ends: 27 [2025-03-04 10:32:53,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:53,829 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:53,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-04 10:32:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-04 10:32:53,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-04 10:32:53,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2025-03-04 10:32:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:53,856 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-04 10:32:53,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-04 10:32:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 10:32:53,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:53,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:53,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:53,857 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:53,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:53,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1227885138, now seen corresponding path program 1 times [2025-03-04 10:32:53,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:53,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216512409] [2025-03-04 10:32:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 10:32:53,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 10:32:53,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:53,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216512409] [2025-03-04 10:32:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216512409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:32:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423609020] [2025-03-04 10:32:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:53,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:32:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:53,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:32:53,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:32:53,915 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:53,949 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2025-03-04 10:32:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:32:53,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-04 10:32:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:53,950 INFO L225 Difference]: With dead ends: 27 [2025-03-04 10:32:53,950 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 10:32:53,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:32:53,951 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:53,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 10:32:53,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-04 10:32:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-04 10:32:53,954 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2025-03-04 10:32:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:53,954 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-04 10:32:53,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-04 10:32:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 10:32:53,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:53,954 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:53,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:53,954 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:53,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:53,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1869385819, now seen corresponding path program 1 times [2025-03-04 10:32:53,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:53,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367894795] [2025-03-04 10:32:53,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:53,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:53,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 10:32:53,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 10:32:53,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:53,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:54,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367894795] [2025-03-04 10:32:54,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367894795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:54,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:54,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:32:54,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962224987] [2025-03-04 10:32:54,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:54,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:32:54,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:54,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:32:54,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:32:54,024 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:54,096 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2025-03-04 10:32:54,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:32:54,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 10:32:54,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:54,097 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:32:54,097 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:32:54,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:32:54,097 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:54,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:32:54,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-04 10:32:54,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-04 10:32:54,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2025-03-04 10:32:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:54,100 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-04 10:32:54,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-04 10:32:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:54,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:54,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:54,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:54,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:54,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:54,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2116385516, now seen corresponding path program 1 times [2025-03-04 10:32:54,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:54,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135587038] [2025-03-04 10:32:54,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:54,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:54,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:54,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135587038] [2025-03-04 10:32:54,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135587038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:54,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 10:32:54,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982309344] [2025-03-04 10:32:54,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:54,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:32:54,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:54,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:32:54,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:32:54,189 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:54,270 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-03-04 10:32:54,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:32:54,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 10:32:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:54,271 INFO L225 Difference]: With dead ends: 30 [2025-03-04 10:32:54,272 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:32:54,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:32:54,273 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:54,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:54,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:32:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 10:32:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-04 10:32:54,278 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-03-04 10:32:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:54,279 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-04 10:32:54,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-04 10:32:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-04 10:32:54,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:54,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:54,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:54,280 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:54,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1400409627, now seen corresponding path program 1 times [2025-03-04 10:32:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917346275] [2025-03-04 10:32:54,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:54,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:54,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:54,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:54,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917346275] [2025-03-04 10:32:54,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917346275] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:54,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880736876] [2025-03-04 10:32:54,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:54,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:54,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:54,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:32:54,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 10:32:54,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 10:32:54,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:54,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:32:54,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:54,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:54,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880736876] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:54,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:54,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-04 10:32:54,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777203636] [2025-03-04 10:32:54,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:54,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:32:54,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:54,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:32:54,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:32:54,570 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:54,709 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-03-04 10:32:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:32:54,710 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-04 10:32:54,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:54,711 INFO L225 Difference]: With dead ends: 50 [2025-03-04 10:32:54,711 INFO L226 Difference]: Without dead ends: 48 [2025-03-04 10:32:54,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:32:54,713 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:54,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 67 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-04 10:32:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-04 10:32:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2025-03-04 10:32:54,722 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 20 [2025-03-04 10:32:54,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:54,724 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2025-03-04 10:32:54,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:54,724 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2025-03-04 10:32:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:32:54,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:54,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:32:54,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:32:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:54,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1459009413, now seen corresponding path program 1 times [2025-03-04 10:32:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255519183] [2025-03-04 10:32:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:54,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:32:54,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:32:54,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:54,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,134 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:55,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255519183] [2025-03-04 10:32:55,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255519183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:55,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169465650] [2025-03-04 10:32:55,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:55,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:55,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:55,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:32:55,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 10:32:55,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 10:32:55,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:55,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:55,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:32:55,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:55,257 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:55,471 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169465650] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:55,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:55,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-04 10:32:55,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420749373] [2025-03-04 10:32:55,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:55,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 10:32:55,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:55,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 10:32:55,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:32:55,475 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:55,721 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-04 10:32:55,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 10:32:55,722 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 10:32:55,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:55,723 INFO L225 Difference]: With dead ends: 92 [2025-03-04 10:32:55,723 INFO L226 Difference]: Without dead ends: 90 [2025-03-04 10:32:55,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 10:32:55,724 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 130 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:55,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 67 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:55,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-04 10:32:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-04 10:32:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2025-03-04 10:32:55,731 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 38 [2025-03-04 10:32:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:55,731 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2025-03-04 10:32:55,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2025-03-04 10:32:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 10:32:55,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:55,733 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-04 10:32:55,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:32:55,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:32:55,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:55,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:55,934 INFO L85 PathProgramCache]: Analyzing trace with hash 666811652, now seen corresponding path program 2 times [2025-03-04 10:32:55,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:55,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585201717] [2025-03-04 10:32:55,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:55,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:55,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:32:55,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:32:55,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:55,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585201717] [2025-03-04 10:32:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585201717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237100971] [2025-03-04 10:32:56,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:56,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:56,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:56,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:56,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:32:56,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-04 10:32:56,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 10:32:56,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:56,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:56,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 10:32:56,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:56,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:57,162 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237100971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:57,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2025-03-04 10:32:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913322325] [2025-03-04 10:32:57,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:57,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 10:32:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 10:32:57,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 10:32:57,168 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:57,843 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2025-03-04 10:32:57,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-04 10:32:57,843 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 10:32:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:57,844 INFO L225 Difference]: With dead ends: 170 [2025-03-04 10:32:57,844 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 10:32:57,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 10:32:57,847 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 330 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:57,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 110 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:57,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 10:32:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-03-04 10:32:57,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 138 states have internal predecessors, (139), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:57,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2025-03-04 10:32:57,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2025-03-04 10:32:57,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:57,865 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2025-03-04 10:32:57,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:32:57,867 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2025-03-04 10:32:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 10:32:57,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:57,871 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-04 10:32:57,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:58,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:58,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:58,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1107556695, now seen corresponding path program 2 times [2025-03-04 10:32:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248102528] [2025-03-04 10:32:58,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:58,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 10:32:58,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 10:32:58,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,461 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:59,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248102528] [2025-03-04 10:32:59,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248102528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754136596] [2025-03-04 10:32:59,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:59,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:59,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:32:59,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 10:32:59,510 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 10:32:59,510 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:59,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:59,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-04 10:32:59,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:59,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:01,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754136596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:01,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:01,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2025-03-04 10:33:01,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040090783] [2025-03-04 10:33:01,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:01,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-03-04 10:33:01,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:01,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-03-04 10:33:01,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-03-04 10:33:01,239 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:02,782 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2025-03-04 10:33:02,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-04 10:33:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-03-04 10:33:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:02,784 INFO L225 Difference]: With dead ends: 332 [2025-03-04 10:33:02,784 INFO L226 Difference]: Without dead ends: 330 [2025-03-04 10:33:02,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-03-04 10:33:02,789 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 670 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:02,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 127 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:33:02,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-04 10:33:02,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-03-04 10:33:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 272 states have (on average 1.0073529411764706) internal successors, (274), 273 states have internal predecessors, (274), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2025-03-04 10:33:02,816 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 158 [2025-03-04 10:33:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:02,817 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2025-03-04 10:33:02,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2025-03-04 10:33:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-04 10:33:02,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:02,821 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2025-03-04 10:33:02,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:33:03,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:03,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:33:03,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:03,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1359297112, now seen corresponding path program 3 times [2025-03-04 10:33:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701213740] [2025-03-04 10:33:03,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:03,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:03,034 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-03-04 10:33:03,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 10:33:03,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-04 10:33:03,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701213740] [2025-03-04 10:33:07,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701213740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:07,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131523580] [2025-03-04 10:33:07,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:07,013 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:33:07,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-03-04 10:33:07,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-03-04 10:33:07,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-04 10:33:07,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:07,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-04 10:33:07,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:07,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:12,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131523580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:12,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:12,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2025-03-04 10:33:12,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352237753] [2025-03-04 10:33:12,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:12,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-03-04 10:33:12,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:12,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-03-04 10:33:12,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-03-04 10:33:12,750 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:17,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:17,881 INFO L93 Difference]: Finished difference Result 650 states and 701 transitions. [2025-03-04 10:33:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-03-04 10:33:17,884 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-03-04 10:33:17,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:17,886 INFO L225 Difference]: With dead ends: 650 [2025-03-04 10:33:17,886 INFO L226 Difference]: Without dead ends: 648 [2025-03-04 10:33:17,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-03-04 10:33:17,891 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 2095 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2095 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:17,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2095 Valid, 155 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:33:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-04 10:33:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2025-03-04 10:33:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 537 states have (on average 1.0037243947858474) internal successors, (539), 538 states have internal predecessors, (539), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 646 transitions. [2025-03-04 10:33:17,926 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 646 transitions. Word has length 320 [2025-03-04 10:33:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:17,927 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 646 transitions. [2025-03-04 10:33:17,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:33:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 646 transitions. [2025-03-04 10:33:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-03-04 10:33:17,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:17,935 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2025-03-04 10:33:17,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:33:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:18,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:33:18,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1314206879, now seen corresponding path program 3 times [2025-03-04 10:33:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111851236] [2025-03-04 10:33:18,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:18,152 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-03-04 10:33:18,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-03-04 10:33:18,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-04 10:33:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:33,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111851236] [2025-03-04 10:33:33,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111851236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:33,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112495646] [2025-03-04 10:33:33,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:33:33,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:33,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:33,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:33,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:33:33,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-03-04 10:33:33,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-03-04 10:33:33,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-04 10:33:33,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:33,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 214 conjuncts are in the unsatisfiable core [2025-03-04 10:33:33,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:34,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:33:52,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112495646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:52,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:52,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214, 214] total 427 [2025-03-04 10:33:52,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600577433] [2025-03-04 10:33:52,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:52,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 428 states [2025-03-04 10:33:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:52,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 428 interpolants. [2025-03-04 10:33:52,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23114, Invalid=159642, Unknown=0, NotChecked=0, Total=182756 [2025-03-04 10:33:52,908 INFO L87 Difference]: Start difference. First operand 646 states and 646 transitions. Second operand has 428 states, 425 states have (on average 2.498823529411765) internal successors, (1062), 216 states have internal predecessors, (1062), 212 states have call successors, (212), 212 states have call predecessors, (212), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:14,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:34:14,051 INFO L93 Difference]: Finished difference Result 1292 states and 1397 transitions. [2025-03-04 10:34:14,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 428 states. [2025-03-04 10:34:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 428 states, 425 states have (on average 2.498823529411765) internal successors, (1062), 216 states have internal predecessors, (1062), 212 states have call successors, (212), 212 states have call predecessors, (212), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 638 [2025-03-04 10:34:14,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:34:14,057 INFO L225 Difference]: With dead ends: 1292 [2025-03-04 10:34:14,057 INFO L226 Difference]: Without dead ends: 1290 [2025-03-04 10:34:14,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132720 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=57352, Invalid=351608, Unknown=0, NotChecked=0, Total=408960 [2025-03-04 10:34:14,072 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4495 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4495 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:34:14,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4495 Valid, 180 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:34:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-04 10:34:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1288. [2025-03-04 10:34:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1072 states have (on average 1.001865671641791) internal successors, (1074), 1073 states have internal predecessors, (1074), 214 states have call successors, (214), 214 states have call predecessors, (214), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1288 transitions. [2025-03-04 10:34:14,108 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1288 transitions. Word has length 638 [2025-03-04 10:34:14,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:34:14,108 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1288 transitions. [2025-03-04 10:34:14,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 428 states, 425 states have (on average 2.498823529411765) internal successors, (1062), 216 states have internal predecessors, (1062), 212 states have call successors, (212), 212 states have call predecessors, (212), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:34:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1288 transitions. [2025-03-04 10:34:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-03-04 10:34:14,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:34:14,118 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 106, 106, 106, 106, 106, 106, 106, 106, 106, 1, 1, 1, 1, 1] [2025-03-04 10:34:14,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:34:14,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:34:14,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:34:14,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:34:14,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1342719944, now seen corresponding path program 4 times [2025-03-04 10:34:14,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:34:14,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433796123] [2025-03-04 10:34:14,319 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:34:14,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:34:14,337 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1280 statements into 2 equivalence classes. [2025-03-04 10:34:14,747 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1280 of 1280 statements. [2025-03-04 10:34:14,748 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:34:14,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat