./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 21:09:59,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:09:59,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 21:09:59,754 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:09:59,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:09:59,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:09:59,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:09:59,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:09:59,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:09:59,786 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:09:59,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:09:59,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:09:59,788 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:09:59,788 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:09:59,790 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:09:59,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:09:59,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:09:59,791 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 21:09:59,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:09:59,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 21:09:59,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:09:59,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:09:59,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:09:59,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:09:59,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:09:59,796 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:09:59,797 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:09:59,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 21:09:59,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:09:59,797 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:09:59,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:09:59,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:09:59,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:09:59,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:09:59,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:09:59,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:09:59,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:09:59,800 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:09:59,800 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:09:59,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:09:59,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:09:59,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:09:59,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:09:59,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:09:59,802 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bfe5681b6d73d5859a119345279b9da165675f4eb4d814fdf24f92881f7a27f [2024-10-11 21:10:00,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:10:00,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:10:00,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:10:00,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:10:00,067 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:10:00,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2024-10-11 21:10:01,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:10:01,682 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:10:01,682 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps6-ll_unwindbound50.c [2024-10-11 21:10:01,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa35284a2/2845daf76fd344cda5a8dd276db6807c/FLAG98ccee898 [2024-10-11 21:10:01,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/aa35284a2/2845daf76fd344cda5a8dd276db6807c [2024-10-11 21:10:01,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:10:01,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:10:01,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:10:01,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:10:01,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:10:01,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:01,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729787b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01, skipping insertion in model container [2024-10-11 21:10:01,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:01,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:10:01,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:10:01,939 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:10:01,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:10:01,997 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:10:01,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01 WrapperNode [2024-10-11 21:10:01,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:10:01,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:10:01,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:10:01,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:10:02,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,039 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 153 [2024-10-11 21:10:02,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:10:02,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:10:02,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:10:02,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:10:02,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,054 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 21:10:02,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,084 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:10:02,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:10:02,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:10:02,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:10:02,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (1/1) ... [2024-10-11 21:10:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:10:02,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:02,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:10:02,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:10:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:10:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:10:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:10:02,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:10:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 21:10:02,177 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 21:10:02,239 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:10:02,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:10:02,821 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-10-11 21:10:02,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:10:02,850 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:10:02,850 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 21:10:02,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:02 BoogieIcfgContainer [2024-10-11 21:10:02,854 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:10:02,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:10:02,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:10:02,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:10:02,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:10:01" (1/3) ... [2024-10-11 21:10:02,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76842cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:02, skipping insertion in model container [2024-10-11 21:10:02,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:01" (2/3) ... [2024-10-11 21:10:02,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76842cdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:02, skipping insertion in model container [2024-10-11 21:10:02,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:02" (3/3) ... [2024-10-11 21:10:02,862 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll_unwindbound50.c [2024-10-11 21:10:02,880 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:10:02,880 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-10-11 21:10:02,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:10:02,945 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;@c8465c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:10:02,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-10-11 21:10:02,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 114 states have (on average 1.956140350877193) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:10:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:10:02,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:02,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:10:02,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 271673227, now seen corresponding path program 1 times [2024-10-11 21:10:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:02,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101294170] [2024-10-11 21:10:02,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:02,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:03,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101294170] [2024-10-11 21:10:03,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101294170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125185321] [2024-10-11 21:10:03,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:03,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 21:10:03,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:03,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 21:10:03,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:10:03,129 INFO L87 Difference]: Start difference. First operand has 223 states, 114 states have (on average 1.956140350877193) internal successors, (223), 218 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:03,170 INFO L93 Difference]: Finished difference Result 419 states and 458 transitions. [2024-10-11 21:10:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 21:10:03,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 21:10:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:03,187 INFO L225 Difference]: With dead ends: 419 [2024-10-11 21:10:03,187 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 21:10:03,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 21:10:03,196 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:03,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 21:10:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-11 21:10:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 113 states have (on average 1.7079646017699115) internal successors, (193), 191 states have internal predecessors, (193), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2024-10-11 21:10:03,256 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 5 [2024-10-11 21:10:03,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:03,257 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2024-10-11 21:10:03,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2024-10-11 21:10:03,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 21:10:03,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:03,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 21:10:03,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:10:03,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:03,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:03,260 INFO L85 PathProgramCache]: Analyzing trace with hash 271732809, now seen corresponding path program 1 times [2024-10-11 21:10:03,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:03,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570789980] [2024-10-11 21:10:03,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:03,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:03,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570789980] [2024-10-11 21:10:03,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570789980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:03,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:03,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:03,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533454178] [2024-10-11 21:10:03,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:03,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:03,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:03,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:03,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:03,377 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:03,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:03,453 INFO L93 Difference]: Finished difference Result 286 states and 288 transitions. [2024-10-11 21:10:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:10:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 21:10:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:03,468 INFO L225 Difference]: With dead ends: 286 [2024-10-11 21:10:03,468 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 21:10:03,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:10:03,470 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 4 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:03,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 572 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 21:10:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-10-11 21:10:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 195 states have internal predecessors, (197), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2024-10-11 21:10:03,484 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 5 [2024-10-11 21:10:03,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:03,496 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2024-10-11 21:10:03,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2024-10-11 21:10:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 21:10:03,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:03,498 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:03,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:10:03,498 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash -821192215, now seen corresponding path program 1 times [2024-10-11 21:10:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:03,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104389588] [2024-10-11 21:10:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:03,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104389588] [2024-10-11 21:10:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104389588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:03,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:03,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875506742] [2024-10-11 21:10:03,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:03,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:03,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:03,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:03,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:03,561 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:04,008 INFO L93 Difference]: Finished difference Result 359 states and 367 transitions. [2024-10-11 21:10:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 21:10:04,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:04,010 INFO L225 Difference]: With dead ends: 359 [2024-10-11 21:10:04,011 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 21:10:04,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:04,016 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 98 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:04,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 136 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:10:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 21:10:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 289. [2024-10-11 21:10:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 206 states have (on average 1.4368932038834952) internal successors, (296), 284 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:10:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 302 transitions. [2024-10-11 21:10:04,047 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 302 transitions. Word has length 8 [2024-10-11 21:10:04,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:04,048 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 302 transitions. [2024-10-11 21:10:04,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 302 transitions. [2024-10-11 21:10:04,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-11 21:10:04,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:04,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:04,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:10:04,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:04,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1750947153, now seen corresponding path program 1 times [2024-10-11 21:10:04,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:04,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530746190] [2024-10-11 21:10:04,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:04,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:04,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:04,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530746190] [2024-10-11 21:10:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530746190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:04,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:04,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005309294] [2024-10-11 21:10:04,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:04,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:04,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:04,204 INFO L87 Difference]: Start difference. First operand 289 states and 302 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:04,274 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions. [2024-10-11 21:10:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:04,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2024-10-11 21:10:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:04,276 INFO L225 Difference]: With dead ends: 313 [2024-10-11 21:10:04,276 INFO L226 Difference]: Without dead ends: 306 [2024-10-11 21:10:04,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:04,278 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 68 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:04,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 358 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:10:04,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-10-11 21:10:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 288. [2024-10-11 21:10:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 205 states have (on average 1.4097560975609755) internal successors, (289), 283 states have internal predecessors, (289), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:10:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 295 transitions. [2024-10-11 21:10:04,295 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 295 transitions. Word has length 46 [2024-10-11 21:10:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:04,295 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 295 transitions. [2024-10-11 21:10:04,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,296 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 295 transitions. [2024-10-11 21:10:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-11 21:10:04,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:04,298 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 21:10:04,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:04,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash 966970257, now seen corresponding path program 1 times [2024-10-11 21:10:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514583329] [2024-10-11 21:10:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514583329] [2024-10-11 21:10:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514583329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:04,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:04,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207566054] [2024-10-11 21:10:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:04,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:04,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:04,423 INFO L87 Difference]: Start difference. First operand 288 states and 295 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:04,611 INFO L93 Difference]: Finished difference Result 308 states and 313 transitions. [2024-10-11 21:10:04,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:04,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-11 21:10:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:04,613 INFO L225 Difference]: With dead ends: 308 [2024-10-11 21:10:04,613 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 21:10:04,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:04,616 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 154 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:04,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 283 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:10:04,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 21:10:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2024-10-11 21:10:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 164 states have (on average 1.5) internal successors, (246), 242 states have internal predecessors, (246), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:10:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions. [2024-10-11 21:10:04,626 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 48 [2024-10-11 21:10:04,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:04,626 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions. [2024-10-11 21:10:04,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 21:10:04,626 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions. [2024-10-11 21:10:04,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-11 21:10:04,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:04,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:04,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 21:10:04,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:04,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:04,629 INFO L85 PathProgramCache]: Analyzing trace with hash 337766354, now seen corresponding path program 1 times [2024-10-11 21:10:04,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:04,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270535749] [2024-10-11 21:10:04,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270535749] [2024-10-11 21:10:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270535749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:10:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993095001] [2024-10-11 21:10:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:04,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:10:04,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:10:04,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:04,719 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:04,740 INFO L93 Difference]: Finished difference Result 249 states and 252 transitions. [2024-10-11 21:10:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:04,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2024-10-11 21:10:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:04,743 INFO L225 Difference]: With dead ends: 249 [2024-10-11 21:10:04,743 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 21:10:04,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:10:04,745 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:04,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 382 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 21:10:04,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-11 21:10:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 164 states have (on average 1.4878048780487805) internal successors, (244), 242 states have internal predecessors, (244), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 21:10:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 250 transitions. [2024-10-11 21:10:04,759 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 250 transitions. Word has length 56 [2024-10-11 21:10:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 250 transitions. [2024-10-11 21:10:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 250 transitions. [2024-10-11 21:10:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 21:10:04,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:04,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:04,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:10:04,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:04,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash -156389435, now seen corresponding path program 1 times [2024-10-11 21:10:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819721786] [2024-10-11 21:10:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:04,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140538727] [2024-10-11 21:10:04,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:04,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:04,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:10:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:04,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:10:04,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:05,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:10:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:05,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819721786] [2024-10-11 21:10:05,008 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:05,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140538727] [2024-10-11 21:10:05,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140538727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959223244] [2024-10-11 21:10:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:05,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:05,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:05,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:05,010 INFO L87 Difference]: Start difference. First operand 247 states and 250 transitions. Second operand has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:05,459 INFO L93 Difference]: Finished difference Result 427 states and 441 transitions. [2024-10-11 21:10:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:05,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2024-10-11 21:10:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:05,461 INFO L225 Difference]: With dead ends: 427 [2024-10-11 21:10:05,461 INFO L226 Difference]: Without dead ends: 362 [2024-10-11 21:10:05,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:05,462 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:05,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 161 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 21:10:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-10-11 21:10:05,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 354. [2024-10-11 21:10:05,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3605947955390334) internal successors, (366), 347 states have internal predecessors, (366), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:05,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 376 transitions. [2024-10-11 21:10:05,474 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 376 transitions. Word has length 61 [2024-10-11 21:10:05,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 376 transitions. [2024-10-11 21:10:05,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.666666666666668) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:05,475 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 376 transitions. [2024-10-11 21:10:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 21:10:05,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:05,477 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:05,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 21:10:05,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:05,682 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:05,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash 72694558, now seen corresponding path program 1 times [2024-10-11 21:10:05,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:05,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407429552] [2024-10-11 21:10:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:05,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:05,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407429552] [2024-10-11 21:10:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407429552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547329266] [2024-10-11 21:10:05,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:05,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:05,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:05,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:05,812 INFO L87 Difference]: Start difference. First operand 354 states and 376 transitions. Second operand has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:05,900 INFO L93 Difference]: Finished difference Result 355 states and 376 transitions. [2024-10-11 21:10:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:10:05,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2024-10-11 21:10:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:05,903 INFO L225 Difference]: With dead ends: 355 [2024-10-11 21:10:05,903 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:10:05,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:05,905 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 58 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:05,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 316 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:10:05,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:10:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 21:10:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 347 states have internal predecessors, (365), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 375 transitions. [2024-10-11 21:10:05,920 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 375 transitions. Word has length 68 [2024-10-11 21:10:05,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:05,922 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 375 transitions. [2024-10-11 21:10:05,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.0) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:05,922 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 375 transitions. [2024-10-11 21:10:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 21:10:05,923 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:05,923 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:05,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 21:10:05,924 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:05,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2041435827, now seen corresponding path program 1 times [2024-10-11 21:10:05,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:05,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747709853] [2024-10-11 21:10:05,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747709853] [2024-10-11 21:10:06,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747709853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:06,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:10:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:10:06,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692348374] [2024-10-11 21:10:06,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:06,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:06,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:06,068 INFO L87 Difference]: Start difference. First operand 354 states and 375 transitions. Second operand has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:06,160 INFO L93 Difference]: Finished difference Result 355 states and 375 transitions. [2024-10-11 21:10:06,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:06,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2024-10-11 21:10:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:06,162 INFO L225 Difference]: With dead ends: 355 [2024-10-11 21:10:06,162 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 21:10:06,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:10:06,163 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 50 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:06,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 325 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:10:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 21:10:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 21:10:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 269 states have (on average 1.3531598513011152) internal successors, (364), 347 states have internal predecessors, (364), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 374 transitions. [2024-10-11 21:10:06,173 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 374 transitions. Word has length 69 [2024-10-11 21:10:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:06,174 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 374 transitions. [2024-10-11 21:10:06,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.333333333333332) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 374 transitions. [2024-10-11 21:10:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 21:10:06,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:06,178 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:06,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:10:06,178 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash 980225935, now seen corresponding path program 1 times [2024-10-11 21:10:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:06,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809373385] [2024-10-11 21:10:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809373385] [2024-10-11 21:10:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809373385] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23661005] [2024-10-11 21:10:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:06,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:06,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:10:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:10:06,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:06,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:06,484 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:10:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23661005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:06,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:10:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:10:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414928532] [2024-10-11 21:10:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:10:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:06,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:10:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:10:06,487 INFO L87 Difference]: Start difference. First operand 354 states and 374 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:06,511 INFO L93 Difference]: Finished difference Result 354 states and 374 transitions. [2024-10-11 21:10:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2024-10-11 21:10:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:06,513 INFO L225 Difference]: With dead ends: 354 [2024-10-11 21:10:06,513 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 21:10:06,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:10:06,514 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 134 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:06,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 21:10:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2024-10-11 21:10:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 269 states have (on average 1.345724907063197) internal successors, (362), 346 states have internal predecessors, (362), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 372 transitions. [2024-10-11 21:10:06,525 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 372 transitions. Word has length 71 [2024-10-11 21:10:06,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:06,525 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 372 transitions. [2024-10-11 21:10:06,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 372 transitions. [2024-10-11 21:10:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 21:10:06,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:06,527 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:06,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:10:06,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:06,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:06,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash 322232961, now seen corresponding path program 1 times [2024-10-11 21:10:06,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:06,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111439723] [2024-10-11 21:10:06,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:06,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:06,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111439723] [2024-10-11 21:10:06,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111439723] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11151848] [2024-10-11 21:10:06,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:06,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:06,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:10:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:06,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 21:10:06,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:06,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:06,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:10:06,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11151848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:06,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:10:06,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-10-11 21:10:06,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581250840] [2024-10-11 21:10:06,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:06,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:10:06,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:06,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:10:06,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:10:06,986 INFO L87 Difference]: Start difference. First operand 353 states and 372 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:07,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:07,034 INFO L93 Difference]: Finished difference Result 483 states and 507 transitions. [2024-10-11 21:10:07,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:10:07,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2024-10-11 21:10:07,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:07,037 INFO L225 Difference]: With dead ends: 483 [2024-10-11 21:10:07,037 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 21:10:07,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:10:07,038 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 131 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:07,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 890 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:07,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 21:10:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 442. [2024-10-11 21:10:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 356 states have (on average 1.353932584269663) internal successors, (482), 434 states have internal predecessors, (482), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-11 21:10:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 496 transitions. [2024-10-11 21:10:07,050 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 496 transitions. Word has length 72 [2024-10-11 21:10:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:07,050 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 496 transitions. [2024-10-11 21:10:07,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 496 transitions. [2024-10-11 21:10:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:10:07,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:07,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:07,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 21:10:07,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:07,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:07,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1412016764, now seen corresponding path program 1 times [2024-10-11 21:10:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968052313] [2024-10-11 21:10:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:07,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:07,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968052313] [2024-10-11 21:10:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968052313] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:07,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190466556] [2024-10-11 21:10:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:07,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:07,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:07,379 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:07,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:10:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:07,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 21:10:07,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:07,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:07,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190466556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:07,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:10:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2024-10-11 21:10:07,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978404782] [2024-10-11 21:10:07,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:07,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 21:10:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:07,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 21:10:07,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-11 21:10:07,684 INFO L87 Difference]: Start difference. First operand 442 states and 496 transitions. Second operand has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:10:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:07,808 INFO L93 Difference]: Finished difference Result 761 states and 804 transitions. [2024-10-11 21:10:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 21:10:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 112 [2024-10-11 21:10:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:07,813 INFO L225 Difference]: With dead ends: 761 [2024-10-11 21:10:07,813 INFO L226 Difference]: Without dead ends: 631 [2024-10-11 21:10:07,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-10-11 21:10:07,814 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 347 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:07,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1013 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:10:07,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-10-11 21:10:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 530. [2024-10-11 21:10:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 440 states have (on average 1.4636363636363636) internal successors, (644), 518 states have internal predecessors, (644), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:10:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 660 transitions. [2024-10-11 21:10:07,828 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 660 transitions. Word has length 112 [2024-10-11 21:10:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:07,829 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 660 transitions. [2024-10-11 21:10:07,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.461538461538462) internal successors, (188), 13 states have internal predecessors, (188), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 21:10:07,829 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 660 transitions. [2024-10-11 21:10:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 21:10:07,830 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:07,830 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:07,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 21:10:08,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:10:08,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1056395817, now seen corresponding path program 1 times [2024-10-11 21:10:08,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543411645] [2024-10-11 21:10:08,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:08,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:08,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673135129] [2024-10-11 21:10:08,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:08,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:08,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:10:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:08,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:10:08,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:08,423 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:08,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:08,678 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:08,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543411645] [2024-10-11 21:10:08,679 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:08,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673135129] [2024-10-11 21:10:08,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673135129] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:08,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:10:08,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:10:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55276607] [2024-10-11 21:10:08,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:10:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:10:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:10:08,681 INFO L87 Difference]: Start difference. First operand 530 states and 660 transitions. Second operand has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:09,642 INFO L93 Difference]: Finished difference Result 544 states and 660 transitions. [2024-10-11 21:10:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 21:10:09,643 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2024-10-11 21:10:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:09,648 INFO L225 Difference]: With dead ends: 544 [2024-10-11 21:10:09,648 INFO L226 Difference]: Without dead ends: 535 [2024-10-11 21:10:09,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 21:10:09,649 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 459 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:09,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 154 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 21:10:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-10-11 21:10:09,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 527. [2024-10-11 21:10:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 440 states have (on average 1.4272727272727272) internal successors, (628), 515 states have internal predecessors, (628), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:10:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 644 transitions. [2024-10-11 21:10:09,667 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 644 transitions. Word has length 112 [2024-10-11 21:10:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:09,667 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 644 transitions. [2024-10-11 21:10:09,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 30.714285714285715) internal successors, (215), 8 states have internal predecessors, (215), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 644 transitions. [2024-10-11 21:10:09,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 21:10:09,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:09,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:09,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:10:09,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 21:10:09,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:09,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:09,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1584102539, now seen corresponding path program 1 times [2024-10-11 21:10:09,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:09,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615478455] [2024-10-11 21:10:09,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:09,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137864755] [2024-10-11 21:10:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:09,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:09,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:09,901 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:09,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 21:10:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:09,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 21:10:09,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:10:10,281 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:10,612 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 21:10:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615478455] [2024-10-11 21:10:10,613 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137864755] [2024-10-11 21:10:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137864755] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:10:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-11 21:10:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250672807] [2024-10-11 21:10:10,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:10,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:10:10,615 INFO L87 Difference]: Start difference. First operand 527 states and 644 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:16,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:10:21,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:10:27,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 21:10:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:27,747 INFO L93 Difference]: Finished difference Result 527 states and 644 transitions. [2024-10-11 21:10:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:10:27,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 114 [2024-10-11 21:10:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:27,750 INFO L225 Difference]: With dead ends: 527 [2024-10-11 21:10:27,750 INFO L226 Difference]: Without dead ends: 525 [2024-10-11 21:10:27,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 220 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:10:27,751 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 99 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:27,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 43 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 3 Unknown, 0 Unchecked, 17.1s Time] [2024-10-11 21:10:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-11 21:10:27,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2024-10-11 21:10:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 440 states have (on average 1.4113636363636364) internal successors, (621), 513 states have internal predecessors, (621), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:10:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 637 transitions. [2024-10-11 21:10:27,768 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 637 transitions. Word has length 114 [2024-10-11 21:10:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:27,769 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 637 transitions. [2024-10-11 21:10:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 21:10:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 637 transitions. [2024-10-11 21:10:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 21:10:27,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:27,770 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:27,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 21:10:27,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 21:10:27,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -938541364, now seen corresponding path program 1 times [2024-10-11 21:10:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:27,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642342532] [2024-10-11 21:10:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 21:10:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,072 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:28,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:28,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642342532] [2024-10-11 21:10:28,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642342532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:28,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969961585] [2024-10-11 21:10:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:28,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:28,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 21:10:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:10:28,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:28,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:10:28,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969961585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:10:28,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:10:28,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-10-11 21:10:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449021119] [2024-10-11 21:10:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:10:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:10:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:28,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:10:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:10:28,254 INFO L87 Difference]: Start difference. First operand 525 states and 637 transitions. Second operand has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:28,282 INFO L93 Difference]: Finished difference Result 561 states and 643 transitions. [2024-10-11 21:10:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:10:28,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 122 [2024-10-11 21:10:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:28,286 INFO L225 Difference]: With dead ends: 561 [2024-10-11 21:10:28,286 INFO L226 Difference]: Without dead ends: 560 [2024-10-11 21:10:28,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:10:28,287 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 233 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:28,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 435 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-11 21:10:28,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 524. [2024-10-11 21:10:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 440 states have (on average 1.4045454545454545) internal successors, (618), 512 states have internal predecessors, (618), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 21:10:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 634 transitions. [2024-10-11 21:10:28,304 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 634 transitions. Word has length 122 [2024-10-11 21:10:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:28,304 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 634 transitions. [2024-10-11 21:10:28,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 21:10:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 634 transitions. [2024-10-11 21:10:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 21:10:28,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:28,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:28,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 21:10:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:28,506 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash 969988935, now seen corresponding path program 1 times [2024-10-11 21:10:28,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:28,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813022547] [2024-10-11 21:10:28,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:28,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 21:10:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 21:10:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:28,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813022547] [2024-10-11 21:10:28,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813022547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:10:28,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341854301] [2024-10-11 21:10:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:28,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:28,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 21:10:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:28,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:10:28,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:28,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:28,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341854301] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:28,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:10:28,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-11 21:10:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136187693] [2024-10-11 21:10:28,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:28,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:10:28,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:10:28,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:10:28,937 INFO L87 Difference]: Start difference. First operand 524 states and 634 transitions. Second operand has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:28,981 INFO L93 Difference]: Finished difference Result 643 states and 712 transitions. [2024-10-11 21:10:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:10:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 123 [2024-10-11 21:10:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:28,984 INFO L225 Difference]: With dead ends: 643 [2024-10-11 21:10:28,984 INFO L226 Difference]: Without dead ends: 642 [2024-10-11 21:10:28,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-11 21:10:28,985 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 118 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:28,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 650 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 21:10:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-11 21:10:29,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 570. [2024-10-11 21:10:29,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 485 states have (on average 1.4247422680412372) internal successors, (691), 557 states have internal predecessors, (691), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:10:29,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 709 transitions. [2024-10-11 21:10:29,004 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 709 transitions. Word has length 123 [2024-10-11 21:10:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:29,004 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 709 transitions. [2024-10-11 21:10:29,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 7 states have internal predecessors, (277), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-11 21:10:29,005 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 709 transitions. [2024-10-11 21:10:29,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 21:10:29,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:29,006 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:10:29,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 21:10:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 21:10:29,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash -468065013, now seen corresponding path program 1 times [2024-10-11 21:10:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738404792] [2024-10-11 21:10:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:29,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [875908831] [2024-10-11 21:10:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:29,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:29,227 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:29,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 21:10:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:29,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 21:10:29,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:29,428 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:29,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:10:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:10:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738404792] [2024-10-11 21:10:29,645 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:10:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875908831] [2024-10-11 21:10:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875908831] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:10:29,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 21:10:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 21:10:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728883780] [2024-10-11 21:10:29,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 21:10:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:10:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:10:29,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:10:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:10:29,647 INFO L87 Difference]: Start difference. First operand 570 states and 709 transitions. Second operand has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 21:10:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:10:30,367 INFO L93 Difference]: Finished difference Result 619 states and 715 transitions. [2024-10-11 21:10:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:10:30,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 127 [2024-10-11 21:10:30,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:10:30,370 INFO L225 Difference]: With dead ends: 619 [2024-10-11 21:10:30,370 INFO L226 Difference]: Without dead ends: 554 [2024-10-11 21:10:30,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-11 21:10:30,371 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 558 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 21:10:30,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 158 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 21:10:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-10-11 21:10:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 548. [2024-10-11 21:10:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 481 states have (on average 1.2328482328482329) internal successors, (593), 536 states have internal predecessors, (593), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 21:10:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 611 transitions. [2024-10-11 21:10:30,387 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 611 transitions. Word has length 127 [2024-10-11 21:10:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:10:30,387 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 611 transitions. [2024-10-11 21:10:30,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.57142857142857) internal successors, (235), 8 states have internal predecessors, (235), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 21:10:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 611 transitions. [2024-10-11 21:10:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 21:10:30,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:10:30,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-11 21:10:30,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 21:10:30,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 21:10:30,594 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 101 more)] === [2024-10-11 21:10:30,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:10:30,594 INFO L85 PathProgramCache]: Analyzing trace with hash -43009901, now seen corresponding path program 1 times [2024-10-11 21:10:30,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:10:30,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977934041] [2024-10-11 21:10:30,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:30,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:10:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 21:10:30,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875659857] [2024-10-11 21:10:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:10:30,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:10:30,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:10:30,622 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:10:30,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 21:10:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:10:30,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 21:10:30,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:10:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 21:10:30,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:10:39,005 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))) (< (+ (* .cse0 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* 10 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (* |c_ULTIMATE.start_main_~y~0#1| 5) (* 5 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (+ 9223372036854775807 (div (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 5)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 6)) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| (- 2))) 12))))) is different from false [2024-10-11 21:10:44,820 WARN L286 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 21:11:31,141 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 21:11:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:11:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977934041] [2024-10-11 21:11:31,142 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 21:11:31,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875659857] [2024-10-11 21:11:31,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875659857] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 21:11:31,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:11:31,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-11 21:11:31,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918620345] [2024-10-11 21:11:31,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:11:31,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 21:11:31,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:11:31,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 21:11:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-11 21:11:31,144 INFO L87 Difference]: Start difference. First operand 548 states and 611 transitions. Second operand has 7 states, 6 states have (on average 15.833333333333334) internal successors, (95), 7 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)