./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/EvenOdd01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/recursive/EvenOdd01-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 90982c548a5fc18702a6b533ab589c969b87a7efde724f265c9d2a7d593347dc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:39:48,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:39:48,947 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:39:48,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:39:48,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:39:48,974 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:39:48,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:39:48,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:39:48,976 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:39:48,977 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:39:48,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:39:48,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:39:48,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:39:48,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:39:48,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:39:48,979 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:39:48,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:48,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:39:48,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:39:48,981 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 90982c548a5fc18702a6b533ab589c969b87a7efde724f265c9d2a7d593347dc [2025-03-09 02:39:49,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:39:49,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:39:49,227 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:39:49,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:39:49,230 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:39:49,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/EvenOdd01-1.c [2025-03-09 02:39:50,356 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1e0d305/fe8262dac12b4348888fa612447f23df/FLAG12281d7f5 [2025-03-09 02:39:50,595 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:39:50,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd01-1.c [2025-03-09 02:39:50,612 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1e0d305/fe8262dac12b4348888fa612447f23df/FLAG12281d7f5 [2025-03-09 02:39:50,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e1e0d305/fe8262dac12b4348888fa612447f23df [2025-03-09 02:39:50,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:39:50,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:39:50,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:50,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:39:50,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:39:50,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d7d80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50, skipping insertion in model container [2025-03-09 02:39:50,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:39:50,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:50,771 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:39:50,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:39:50,801 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:39:50,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50 WrapperNode [2025-03-09 02:39:50,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:39:50,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:50,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:39:50,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:39:50,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,812 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,822 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2025-03-09 02:39:50,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:39:50,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:39:50,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:39:50,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:39:50,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,847 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-09 02:39:50,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,850 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,854 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:39:50,858 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:39:50,858 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:39:50,859 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:39:50,860 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (1/1) ... [2025-03-09 02:39:50,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:39:50,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:50,887 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-09 02:39:50,891 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-09 02:39:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:39:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2025-03-09 02:39:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2025-03-09 02:39:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:39:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2025-03-09 02:39:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2025-03-09 02:39:50,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:39:50,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:39:50,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:39:50,947 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:39:50,991 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc #t~ret5; [2025-03-09 02:39:51,008 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L24: havoc #t~ret4; [2025-03-09 02:39:51,066 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-09 02:39:51,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:39:51,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:39:51,077 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:39:51,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:51 BoogieIcfgContainer [2025-03-09 02:39:51,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:39:51,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:39:51,081 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:39:51,084 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:39:51,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:39:50" (1/3) ... [2025-03-09 02:39:51,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7886135e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:51, skipping insertion in model container [2025-03-09 02:39:51,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:39:50" (2/3) ... [2025-03-09 02:39:51,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7886135e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:39:51, skipping insertion in model container [2025-03-09 02:39:51,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:39:51" (3/3) ... [2025-03-09 02:39:51,090 INFO L128 eAbstractionObserver]: Analyzing ICFG EvenOdd01-1.c [2025-03-09 02:39:51,132 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:39:51,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG EvenOdd01-1.c that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-09 02:39:51,182 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:39:51,192 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;@662f28a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:39:51,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-09 02:39:51,196 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-09 02:39:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 02:39:51,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:51,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:51,200 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:51,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -455251194, now seen corresponding path program 1 times [2025-03-09 02:39:51,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877697490] [2025-03-09 02:39:51,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:51,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 02:39:51,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 02:39:51,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:51,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:51,389 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-09 02:39:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877697490] [2025-03-09 02:39:51,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877697490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:51,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765642940] [2025-03-09 02:39:51,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:51,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:51,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:51,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:51,414 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-09 02:39:51,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:51,514 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-09 02:39:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:51,516 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-09 02:39:51,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:51,520 INFO L225 Difference]: With dead ends: 49 [2025-03-09 02:39:51,520 INFO L226 Difference]: Without dead ends: 27 [2025-03-09 02:39:51,524 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-09 02:39:51,526 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:51,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:51,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-09 02:39:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-03-09 02:39:51,552 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-09 02:39:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-03-09 02:39:51,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2025-03-09 02:39:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:51,557 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-03-09 02:39:51,558 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-09 02:39:51,558 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-03-09 02:39:51,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-09 02:39:51,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:51,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:51,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:39:51,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:51,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1227885138, now seen corresponding path program 1 times [2025-03-09 02:39:51,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:51,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313413411] [2025-03-09 02:39:51,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:51,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:51,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-09 02:39:51,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-09 02:39:51,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:51,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:51,623 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-09 02:39:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:51,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313413411] [2025-03-09 02:39:51,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313413411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:51,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:51,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:39:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538887662] [2025-03-09 02:39:51,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:51,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:39:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:51,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:39:51,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:39:51,627 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-09 02:39:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:51,661 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2025-03-09 02:39:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:39:51,661 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-09 02:39:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:51,662 INFO L225 Difference]: With dead ends: 27 [2025-03-09 02:39:51,662 INFO L226 Difference]: Without dead ends: 26 [2025-03-09 02:39:51,662 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-09 02:39:51,663 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-09 02:39:51,663 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-09 02:39:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-09 02:39:51,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-03-09 02:39:51,665 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-09 02:39:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-09 02:39:51,666 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2025-03-09 02:39:51,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:51,666 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-09 02:39:51,666 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-09 02:39:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-09 02:39:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-09 02:39:51,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:51,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:51,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:39:51,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:51,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1869385819, now seen corresponding path program 1 times [2025-03-09 02:39:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:51,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882151542] [2025-03-09 02:39:51,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:51,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:51,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 02:39:51,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 02:39:51,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:51,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:51,770 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-09 02:39:51,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:51,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882151542] [2025-03-09 02:39:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882151542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:39:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610387161] [2025-03-09 02:39:51,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:51,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:39:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:51,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:39:51,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:39:51,772 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-09 02:39:51,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:51,842 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2025-03-09 02:39:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:39:51,842 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-09 02:39:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:51,843 INFO L225 Difference]: With dead ends: 34 [2025-03-09 02:39:51,843 INFO L226 Difference]: Without dead ends: 33 [2025-03-09 02:39:51,843 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-09 02:39:51,844 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:51,844 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.1s Time] [2025-03-09 02:39:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-09 02:39:51,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-03-09 02:39:51,848 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-09 02:39:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-03-09 02:39:51,848 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2025-03-09 02:39:51,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:51,849 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-03-09 02:39:51,849 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-09 02:39:51,849 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-03-09 02:39:51,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-09 02:39:51,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:51,849 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:51,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:39:51,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:51,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2116385516, now seen corresponding path program 1 times [2025-03-09 02:39:51,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:51,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-09 02:39:51,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:51,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:51,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 02:39:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 02:39:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:51,926 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-09 02:39:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-09 02:39:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511812354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:39:51,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:39:51,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:39:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628738532] [2025-03-09 02:39:51,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:39:51,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:39:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:39:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:39:51,927 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-09 02:39:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:51,997 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-03-09 02:39:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:39:51,997 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-09 02:39:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:51,998 INFO L225 Difference]: With dead ends: 30 [2025-03-09 02:39:51,998 INFO L226 Difference]: Without dead ends: 28 [2025-03-09 02:39:51,998 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-09 02:39:51,998 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-09 02:39:51,999 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-09 02:39:51,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-09 02:39:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-09 02:39:52,003 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-09 02:39:52,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-03-09 02:39:52,004 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-03-09 02:39:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:52,004 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-03-09 02:39:52,004 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-09 02:39:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-03-09 02:39:52,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:39:52,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:52,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:39:52,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:39:52,005 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:52,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1400409627, now seen corresponding path program 1 times [2025-03-09 02:39:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:52,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200507798] [2025-03-09 02:39:52,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:52,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:39:52,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:39:52,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:52,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:52,116 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-09 02:39:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200507798] [2025-03-09 02:39:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200507798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041125801] [2025-03-09 02:39:52,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:52,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:52,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:52,118 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-09 02:39:52,120 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-09 02:39:52,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:39:52,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:39:52,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:52,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:52,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:39:52,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:52,232 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-09 02:39:52,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:52,354 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-09 02:39:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041125801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:52,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:52,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-09 02:39:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929743360] [2025-03-09 02:39:52,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:52,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-09 02:39:52,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:52,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-09 02:39:52,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:39:52,357 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-09 02:39:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:52,506 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-03-09 02:39:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:39:52,507 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-09 02:39:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:52,508 INFO L225 Difference]: With dead ends: 50 [2025-03-09 02:39:52,508 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 02:39:52,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:39:52,509 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 68 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-09 02:39:52,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 68 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:52,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 02:39:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-03-09 02:39:52,518 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-09 02:39:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2025-03-09 02:39:52,519 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 20 [2025-03-09 02:39:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:52,520 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2025-03-09 02:39:52,520 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-09 02:39:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2025-03-09 02:39:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 02:39:52,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:52,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 02:39:52,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:39:52,723 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-09 02:39:52,724 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:52,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1459009413, now seen corresponding path program 1 times [2025-03-09 02:39:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619723299] [2025-03-09 02:39:52,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:52,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:39:52,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:39:52,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:52,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:52,926 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-09 02:39:52,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619723299] [2025-03-09 02:39:52,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619723299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:52,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182201837] [2025-03-09 02:39:52,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:39:52,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:52,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:52,931 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-09 02:39:52,932 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-09 02:39:52,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 02:39:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 02:39:52,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:39:52,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:52,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:39:52,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:53,044 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-09 02:39:53,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:53,268 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-09 02:39:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182201837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:53,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-03-09 02:39:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829029278] [2025-03-09 02:39:53,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:53,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 02:39:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:53,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 02:39:53,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-03-09 02:39:53,272 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-09 02:39:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:53,529 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-03-09 02:39:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-09 02:39:53,529 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-09 02:39:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:53,530 INFO L225 Difference]: With dead ends: 92 [2025-03-09 02:39:53,530 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:39:53,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-03-09 02:39:53,531 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 68 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-09 02:39:53,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 68 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:39:53,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:39:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-09 02:39:53,543 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-09 02:39:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2025-03-09 02:39:53,546 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 38 [2025-03-09 02:39:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:53,546 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2025-03-09 02:39:53,547 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-09 02:39:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2025-03-09 02:39:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:39:53,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:53,549 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-03-09 02:39:53,555 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-09 02:39:53,753 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-09 02:39:53,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:53,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 666811652, now seen corresponding path program 2 times [2025-03-09 02:39:53,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:53,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-03-09 02:39:53,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:53,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-09 02:39:53,773 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:39:53,773 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:53,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:54,245 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-09 02:39:54,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138831091] [2025-03-09 02:39:54,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138831091] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:54,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304469604] [2025-03-09 02:39:54,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:54,249 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-09 02:39:54,267 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-09 02:39:54,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-03-09 02:39:54,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:39:54,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:54,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:54,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 02:39:54,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:54,425 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-09 02:39:54,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:55,068 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-09 02:39:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304469604] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:55,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2025-03-09 02:39:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722273965] [2025-03-09 02:39:55,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-09 02:39:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:55,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-09 02:39:55,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-03-09 02:39:55,073 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-09 02:39:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:39:55,860 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2025-03-09 02:39:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-09 02:39:55,864 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-09 02:39:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:39:55,865 INFO L225 Difference]: With dead ends: 170 [2025-03-09 02:39:55,865 INFO L226 Difference]: Without dead ends: 168 [2025-03-09 02:39:55,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-03-09 02:39:55,870 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 380 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:39:55,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 104 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:39:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-09 02:39:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-03-09 02:39:55,886 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-09 02:39:55,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2025-03-09 02:39:55,887 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2025-03-09 02:39:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:39:55,888 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2025-03-09 02:39:55,888 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-09 02:39:55,888 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2025-03-09 02:39:55,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-09 02:39:55,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:39:55,891 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2025-03-09 02:39:55,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:39:56,091 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-09 02:39:56,092 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:39:56,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:39:56,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1107556695, now seen corresponding path program 2 times [2025-03-09 02:39:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:39:56,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519818334] [2025-03-09 02:39:56,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:39:56,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-09 02:39:56,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-09 02:39:56,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:56,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,494 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-09 02:39:57,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:39:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519818334] [2025-03-09 02:39:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519818334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:39:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385401915] [2025-03-09 02:39:57,495 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:39:57,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:39:57,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:39:57,496 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-09 02:39:57,498 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-09 02:39:57,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-09 02:39:57,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-09 02:39:57,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:39:57,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:39:57,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-09 02:39:57,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:39:57,756 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-09 02:39:57,756 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:39:59,358 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-09 02:39:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385401915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:39:59,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:39:59,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2025-03-09 02:39:59,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533022367] [2025-03-09 02:39:59,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:39:59,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-03-09 02:39:59,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:39:59,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-03-09 02:39:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-03-09 02:39:59,363 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-09 02:40:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:01,059 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2025-03-09 02:40:01,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-09 02:40:01,059 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-09 02:40:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:01,061 INFO L225 Difference]: With dead ends: 332 [2025-03-09 02:40:01,061 INFO L226 Difference]: Without dead ends: 330 [2025-03-09 02:40:01,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-03-09 02:40:01,066 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 945 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:01,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 156 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:40:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-09 02:40:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-03-09 02:40:01,082 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-09 02:40:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2025-03-09 02:40:01,084 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 158 [2025-03-09 02:40:01,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:01,084 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2025-03-09 02:40:01,085 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-09 02:40:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2025-03-09 02:40:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-03-09 02:40:01,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:01,088 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2025-03-09 02:40:01,094 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-09 02:40:01,292 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-09 02:40:01,292 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:40:01,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1359297112, now seen corresponding path program 3 times [2025-03-09 02:40:01,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-03-09 02:40:01,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:01,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-03-09 02:40:01,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-03-09 02:40:01,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-09 02:40:01,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:05,321 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-09 02:40:05,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165301610] [2025-03-09 02:40:05,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165301610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:05,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357397192] [2025-03-09 02:40:05,321 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:05,323 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-09 02:40:05,324 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-09 02:40:05,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-03-09 02:40:05,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-03-09 02:40:05,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-03-09 02:40:05,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:05,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-03-09 02:40:05,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:05,781 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-09 02:40:05,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:11,220 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-09 02:40:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357397192] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:11,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2025-03-09 02:40:11,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262356097] [2025-03-09 02:40:11,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:11,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-03-09 02:40:11,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:11,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-03-09 02:40:11,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-03-09 02:40:11,228 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-09 02:40:16,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:40:16,566 INFO L93 Difference]: Finished difference Result 650 states and 701 transitions. [2025-03-09 02:40:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-03-09 02:40:16,567 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-09 02:40:16,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:40:16,570 INFO L225 Difference]: With dead ends: 650 [2025-03-09 02:40:16,570 INFO L226 Difference]: Without dead ends: 648 [2025-03-09 02:40:16,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-03-09 02:40:16,576 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1820 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:40:16,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 134 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:40:16,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-09 02:40:16,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2025-03-09 02:40:16,608 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-09 02:40:16,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 646 transitions. [2025-03-09 02:40:16,610 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 646 transitions. Word has length 320 [2025-03-09 02:40:16,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:40:16,611 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 646 transitions. [2025-03-09 02:40:16,612 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-09 02:40:16,612 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 646 transitions. [2025-03-09 02:40:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-03-09 02:40:16,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:40:16,623 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2025-03-09 02:40:16,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:40:16,824 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-09 02:40:16,824 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:40:16,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:40:16,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1314206879, now seen corresponding path program 3 times [2025-03-09 02:40:16,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:40:16,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106260177] [2025-03-09 02:40:16,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:16,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:40:16,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-03-09 02:40:16,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-03-09 02:40:16,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-09 02:40:16,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:32,801 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-09 02:40:32,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:40:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106260177] [2025-03-09 02:40:32,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106260177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:40:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508009837] [2025-03-09 02:40:32,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:40:32,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:40:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:40:32,803 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-09 02:40:32,804 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-09 02:40:32,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-03-09 02:40:33,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-03-09 02:40:33,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-03-09 02:40:33,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:40:33,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 214 conjuncts are in the unsatisfiable core [2025-03-09 02:40:33,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:40:33,697 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-09 02:40:33,697 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:40:53,134 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-09 02:40:53,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508009837] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:40:53,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:40:53,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214, 214] total 427 [2025-03-09 02:40:53,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546684507] [2025-03-09 02:40:53,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:40:53,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 428 states [2025-03-09 02:40:53,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:40:53,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 428 interpolants. [2025-03-09 02:40:53,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23114, Invalid=159642, Unknown=0, NotChecked=0, Total=182756 [2025-03-09 02:40:53,149 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-09 02:41:16,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:41:16,169 INFO L93 Difference]: Finished difference Result 1292 states and 1397 transitions. [2025-03-09 02:41:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 428 states. [2025-03-09 02:41:16,171 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-09 02:41:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:41:16,175 INFO L225 Difference]: With dead ends: 1292 [2025-03-09 02:41:16,176 INFO L226 Difference]: Without dead ends: 1290 [2025-03-09 02:41:16,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1700 GetRequests, 1062 SyntacticMatches, 0 SemanticMatches, 638 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132720 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=57352, Invalid=351608, Unknown=0, NotChecked=0, Total=408960 [2025-03-09 02:41:16,189 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 4585 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:41:16,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 122 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-09 02:41:16,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2025-03-09 02:41:16,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1288. [2025-03-09 02:41:16,230 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-09 02:41:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1288 transitions. [2025-03-09 02:41:16,235 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1288 transitions. Word has length 638 [2025-03-09 02:41:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:41:16,236 INFO L471 AbstractCegarLoop]: Abstraction has 1288 states and 1288 transitions. [2025-03-09 02:41:16,237 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-09 02:41:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1288 transitions. [2025-03-09 02:41:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2025-03-09 02:41:16,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:41:16,247 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 106, 106, 106, 106, 106, 106, 106, 106, 106, 1, 1, 1, 1, 1] [2025-03-09 02:41:16,254 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-09 02:41:16,447 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-09 02:41:16,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-09 02:41:16,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:41:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1342719944, now seen corresponding path program 4 times [2025-03-09 02:41:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:41:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-03-09 02:41:16,448 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 02:41:16,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:41:16,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1280 statements into 2 equivalence classes. [2025-03-09 02:41:16,829 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1280 of 1280 statements. [2025-03-09 02:41:16,829 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 02:41:16,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat