./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 20:10:34,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 20:10:35,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 20:10:35,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 20:10:35,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 20:10:35,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 20:10:35,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 20:10:35,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 20:10:35,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 20:10:35,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 20:10:35,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 20:10:35,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 20:10:35,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 20:10:35,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 20:10:35,071 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 20:10:35,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 20:10:35,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 20:10:35,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 20:10:35,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 20:10:35,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 20:10:35,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 20:10:35,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 20:10:35,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 20:10:35,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 20:10:35,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 20:10:35,074 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 20:10:35,074 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 20:10:35,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 20:10:35,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 20:10:35,075 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 20:10:35,075 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 20:10:35,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 20:10:35,076 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 20:10:35,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 20:10:35,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:10:35,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 20:10:35,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 20:10:35,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 20:10:35,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 20:10:35,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 20:10:35,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 20:10:35,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 20:10:35,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 20:10:35,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 20:10:35,078 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/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/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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2024-11-12 20:10:35,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 20:10:35,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 20:10:35,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 20:10:35,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 20:10:35,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 20:10:35,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 20:10:36,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 20:10:36,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 20:10:36,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2024-11-12 20:10:36,689 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacde0652/a10925750cf9470585b994580f134892/FLAG27472178b [2024-11-12 20:10:37,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cacde0652/a10925750cf9470585b994580f134892 [2024-11-12 20:10:37,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 20:10:37,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 20:10:37,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 20:10:37,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 20:10:37,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 20:10:37,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495495aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37, skipping insertion in model container [2024-11-12 20:10:37,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 20:10:37,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:10:37,489 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 20:10:37,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 20:10:37,606 INFO L204 MainTranslator]: Completed translation [2024-11-12 20:10:37,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37 WrapperNode [2024-11-12 20:10:37,607 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 20:10:37,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 20:10:37,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 20:10:37,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 20:10:37,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,711 INFO L138 Inliner]: procedures = 176, calls = 425, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1870 [2024-11-12 20:10:37,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 20:10:37,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 20:10:37,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 20:10:37,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 20:10:37,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,731 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,839 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [401, 2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 98 writes are split as follows [98, 0]. [2024-11-12 20:10:37,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,881 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 20:10:37,931 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 20:10:37,931 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 20:10:37,931 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 20:10:37,932 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (1/1) ... [2024-11-12 20:10:37,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 20:10:37,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:37,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 20:10:37,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 20:10:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 20:10:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 20:10:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 20:10:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 20:10:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 20:10:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 20:10:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 20:10:38,005 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 20:10:38,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 20:10:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 20:10:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 20:10:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 20:10:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 20:10:38,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 20:10:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 20:10:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 20:10:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 20:10:38,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 20:10:38,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 20:10:38,215 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 20:10:38,217 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 20:10:39,471 INFO L? ?]: Removed 424 outVars from TransFormulas that were not future-live. [2024-11-12 20:10:39,471 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 20:10:39,493 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 20:10:39,493 INFO L316 CfgBuilder]: Removed 77 assume(true) statements. [2024-11-12 20:10:39,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:10:39 BoogieIcfgContainer [2024-11-12 20:10:39,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 20:10:39,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 20:10:39,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 20:10:39,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 20:10:39,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:10:37" (1/3) ... [2024-11-12 20:10:39,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f7eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:10:39, skipping insertion in model container [2024-11-12 20:10:39,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:10:37" (2/3) ... [2024-11-12 20:10:39,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148f7eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:10:39, skipping insertion in model container [2024-11-12 20:10:39,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:10:39" (3/3) ... [2024-11-12 20:10:39,503 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-3.i [2024-11-12 20:10:39,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 20:10:39,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 20:10:39,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 20:10:39,579 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;@10fa75fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 20:10:39,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 20:10:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-12 20:10:39,586 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:39,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:39,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:39,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:39,590 INFO L85 PathProgramCache]: Analyzing trace with hash -699476840, now seen corresponding path program 1 times [2024-11-12 20:10:39,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:39,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460771344] [2024-11-12 20:10:39,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:39,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:10:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460771344] [2024-11-12 20:10:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460771344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:39,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:39,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:10:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553725363] [2024-11-12 20:10:39,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:39,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 20:10:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 20:10:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 20:10:39,790 INFO L87 Difference]: Start difference. First operand has 474 states, 462 states have (on average 1.619047619047619) internal successors, (748), 466 states have internal predecessors, (748), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:39,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:39,844 INFO L93 Difference]: Finished difference Result 943 states and 1515 transitions. [2024-11-12 20:10:39,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 20:10:39,846 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-12 20:10:39,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:39,856 INFO L225 Difference]: With dead ends: 943 [2024-11-12 20:10:39,857 INFO L226 Difference]: Without dead ends: 398 [2024-11-12 20:10:39,865 INFO L434 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-11-12 20:10:39,867 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:39,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:10:39,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-12 20:10:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2024-11-12 20:10:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 388 states have (on average 1.443298969072165) internal successors, (560), 390 states have internal predecessors, (560), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2024-11-12 20:10:39,910 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 7 [2024-11-12 20:10:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:39,910 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2024-11-12 20:10:39,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2024-11-12 20:10:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 20:10:39,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:39,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 20:10:39,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:39,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -208885906, now seen corresponding path program 1 times [2024-11-12 20:10:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:39,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050840388] [2024-11-12 20:10:39,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 20:10:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1794625839] [2024-11-12 20:10:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:39,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:39,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:39,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:39,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 20:10:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:40,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 20:10:40,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:10:40,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:40,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050840388] [2024-11-12 20:10:40,122 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 20:10:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794625839] [2024-11-12 20:10:40,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794625839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:40,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 20:10:40,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344103251] [2024-11-12 20:10:40,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:40,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:10:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:10:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:10:40,124 INFO L87 Difference]: Start difference. First operand 398 states and 572 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-11-12 20:10:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:40,181 INFO L93 Difference]: Finished difference Result 785 states and 1133 transitions. [2024-11-12 20:10:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:10:40,185 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-11-12 20:10:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:40,188 INFO L225 Difference]: With dead ends: 785 [2024-11-12 20:10:40,188 INFO L226 Difference]: Without dead ends: 784 [2024-11-12 20:10:40,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:10:40,190 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 543 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:40,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1182 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:10:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2024-11-12 20:10:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 403. [2024-11-12 20:10:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4376590330788803) internal successors, (565), 395 states have internal predecessors, (565), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 577 transitions. [2024-11-12 20:10:40,213 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 577 transitions. Word has length 8 [2024-11-12 20:10:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:40,213 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 577 transitions. [2024-11-12 20:10:40,214 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-11-12 20:10:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 577 transitions. [2024-11-12 20:10:40,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 20:10:40,221 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:40,221 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:40,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 20:10:40,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:40,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:40,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:40,424 INFO L85 PathProgramCache]: Analyzing trace with hash 839446148, now seen corresponding path program 1 times [2024-11-12 20:10:40,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:40,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22793942] [2024-11-12 20:10:40,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:40,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:10:40,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:40,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22793942] [2024-11-12 20:10:40,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22793942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:40,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:40,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:10:40,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733219804] [2024-11-12 20:10:40,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:40,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:10:40,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:40,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:10:40,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:10:40,906 INFO L87 Difference]: Start difference. First operand 403 states and 577 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:41,004 INFO L93 Difference]: Finished difference Result 801 states and 1149 transitions. [2024-11-12 20:10:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:10:41,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 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 152 [2024-11-12 20:10:41,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:41,007 INFO L225 Difference]: With dead ends: 801 [2024-11-12 20:10:41,007 INFO L226 Difference]: Without dead ends: 406 [2024-11-12 20:10:41,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:10:41,010 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 105 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1539 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:41,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1539 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:10:41,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-12 20:10:41,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 403. [2024-11-12 20:10:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 393 states have (on average 1.4198473282442747) internal successors, (558), 395 states have internal predecessors, (558), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 570 transitions. [2024-11-12 20:10:41,025 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 570 transitions. Word has length 152 [2024-11-12 20:10:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 570 transitions. [2024-11-12 20:10:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 570 transitions. [2024-11-12 20:10:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 20:10:41,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:41,034 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:41,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 20:10:41,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:41,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash -609280240, now seen corresponding path program 1 times [2024-11-12 20:10:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009341942] [2024-11-12 20:10:41,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 20:10:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:41,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009341942] [2024-11-12 20:10:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009341942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:41,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:41,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 20:10:41,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982645671] [2024-11-12 20:10:41,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:41,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 20:10:41,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:41,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 20:10:41,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:10:41,246 INFO L87 Difference]: Start difference. First operand 403 states and 570 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:41,280 INFO L93 Difference]: Finished difference Result 925 states and 1319 transitions. [2024-11-12 20:10:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 20:10:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 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 152 [2024-11-12 20:10:41,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:41,285 INFO L225 Difference]: With dead ends: 925 [2024-11-12 20:10:41,285 INFO L226 Difference]: Without dead ends: 530 [2024-11-12 20:10:41,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 20:10:41,287 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 134 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:41,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1120 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:10:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-12 20:10:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2024-11-12 20:10:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 520 states have (on average 1.4307692307692308) internal successors, (744), 522 states have internal predecessors, (744), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:41,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 756 transitions. [2024-11-12 20:10:41,300 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 756 transitions. Word has length 152 [2024-11-12 20:10:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:41,301 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 756 transitions. [2024-11-12 20:10:41,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 20:10:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 756 transitions. [2024-11-12 20:10:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 20:10:41,302 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:41,303 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:41,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 20:10:41,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:41,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1858944130, now seen corresponding path program 1 times [2024-11-12 20:10:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:41,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674523199] [2024-11-12 20:10:41,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:41,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:10:41,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:41,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674523199] [2024-11-12 20:10:41,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674523199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:41,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:41,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:10:41,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999196410] [2024-11-12 20:10:41,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:41,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:10:41,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:41,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:10:41,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:10:41,675 INFO L87 Difference]: Start difference. First operand 530 states and 756 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:41,936 INFO L93 Difference]: Finished difference Result 886 states and 1261 transitions. [2024-11-12 20:10:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:10:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-12 20:10:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:41,940 INFO L225 Difference]: With dead ends: 886 [2024-11-12 20:10:41,940 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 20:10:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:10:41,941 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 36 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:41,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1734 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 20:10:41,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488. [2024-11-12 20:10:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 478 states have (on average 1.395397489539749) internal successors, (667), 480 states have internal predecessors, (667), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 679 transitions. [2024-11-12 20:10:41,953 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 679 transitions. Word has length 167 [2024-11-12 20:10:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 679 transitions. [2024-11-12 20:10:41,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 679 transitions. [2024-11-12 20:10:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 20:10:41,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:41,957 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:41,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 20:10:41,957 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:41,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1122217516, now seen corresponding path program 1 times [2024-11-12 20:10:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:41,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351179032] [2024-11-12 20:10:41,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:41,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:10:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351179032] [2024-11-12 20:10:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351179032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:42,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:42,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:10:42,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982535023] [2024-11-12 20:10:42,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:42,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:10:42,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:42,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:10:42,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:10:42,167 INFO L87 Difference]: Start difference. First operand 488 states and 679 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:42,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:42,606 INFO L93 Difference]: Finished difference Result 844 states and 1173 transitions. [2024-11-12 20:10:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:10:42,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-12 20:10:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:42,608 INFO L225 Difference]: With dead ends: 844 [2024-11-12 20:10:42,609 INFO L226 Difference]: Without dead ends: 491 [2024-11-12 20:10:42,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:10:42,610 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 5 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:42,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:10:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-12 20:10:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 488. [2024-11-12 20:10:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 478 states have (on average 1.389121338912134) internal successors, (664), 480 states have internal predecessors, (664), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 20:10:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 676 transitions. [2024-11-12 20:10:42,622 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 676 transitions. Word has length 167 [2024-11-12 20:10:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:42,622 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 676 transitions. [2024-11-12 20:10:42,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:42,623 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 676 transitions. [2024-11-12 20:10:42,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 20:10:42,624 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:42,624 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:42,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 20:10:42,624 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:42,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1874204302, now seen corresponding path program 1 times [2024-11-12 20:10:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:42,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371148102] [2024-11-12 20:10:42,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 20:10:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371148102] [2024-11-12 20:10:42,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371148102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:42,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:42,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:10:42,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973173453] [2024-11-12 20:10:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:10:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:42,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:10:42,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:10:42,872 INFO L87 Difference]: Start difference. First operand 488 states and 676 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:43,135 INFO L93 Difference]: Finished difference Result 990 states and 1365 transitions. [2024-11-12 20:10:43,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:10:43,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 167 [2024-11-12 20:10:43,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:43,138 INFO L225 Difference]: With dead ends: 990 [2024-11-12 20:10:43,138 INFO L226 Difference]: Without dead ends: 637 [2024-11-12 20:10:43,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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-11-12 20:10:43,140 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 246 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:43,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1343 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-12 20:10:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 634. [2024-11-12 20:10:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 621 states have (on average 1.3719806763285025) internal successors, (852), 623 states have internal predecessors, (852), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-12 20:10:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 870 transitions. [2024-11-12 20:10:43,156 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 870 transitions. Word has length 167 [2024-11-12 20:10:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 870 transitions. [2024-11-12 20:10:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 20:10:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 870 transitions. [2024-11-12 20:10:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-12 20:10:43,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:43,157 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:43,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 20:10:43,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:43,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1498202614, now seen corresponding path program 1 times [2024-11-12 20:10:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626456394] [2024-11-12 20:10:43,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:43,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:43,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:43,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 20:10:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:43,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 20:10:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:43,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:43,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626456394] [2024-11-12 20:10:43,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626456394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:43,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:43,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:10:43,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327253497] [2024-11-12 20:10:43,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:43,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:10:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:10:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:10:43,414 INFO L87 Difference]: Start difference. First operand 634 states and 870 transitions. Second operand has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:43,663 INFO L93 Difference]: Finished difference Result 703 states and 971 transitions. [2024-11-12 20:10:43,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:10:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2024-11-12 20:10:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:43,667 INFO L225 Difference]: With dead ends: 703 [2024-11-12 20:10:43,667 INFO L226 Difference]: Without dead ends: 701 [2024-11-12 20:10:43,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:10:43,669 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 298 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1802 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:43,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1802 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:43,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-12 20:10:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 698. [2024-11-12 20:10:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 682 states have (on average 1.3636363636363635) internal successors, (930), 684 states have internal predecessors, (930), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 954 transitions. [2024-11-12 20:10:43,686 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 954 transitions. Word has length 182 [2024-11-12 20:10:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:43,687 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 954 transitions. [2024-11-12 20:10:43,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 41.25) internal successors, (165), 4 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 954 transitions. [2024-11-12 20:10:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 20:10:43,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:43,688 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:43,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 20:10:43,688 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:43,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:43,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1871343079, now seen corresponding path program 1 times [2024-11-12 20:10:43,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:43,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018679572] [2024-11-12 20:10:43,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:43,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 20:10:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 20:10:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:10:44,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018679572] [2024-11-12 20:10:44,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018679572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:44,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517260097] [2024-11-12 20:10:44,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:44,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:44,323 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:44,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 20:10:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:44,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-12 20:10:44,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:44,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:10:44,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-12 20:10:45,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 20:10:45,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 46 [2024-11-12 20:10:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:45,286 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:45,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517260097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:45,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:45,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2024-11-12 20:10:45,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942353725] [2024-11-12 20:10:45,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:45,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 20:10:45,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:45,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 20:10:45,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:10:45,288 INFO L87 Difference]: Start difference. First operand 698 states and 954 transitions. Second operand has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:46,655 INFO L93 Difference]: Finished difference Result 1361 states and 1854 transitions. [2024-11-12 20:10:46,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 20:10:46,656 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-12 20:10:46,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:46,659 INFO L225 Difference]: With dead ends: 1361 [2024-11-12 20:10:46,659 INFO L226 Difference]: Without dead ends: 751 [2024-11-12 20:10:46,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-12 20:10:46,660 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 994 mSDsluCounter, 2141 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 2617 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:46,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 2617 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 20:10:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-11-12 20:10:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 732. [2024-11-12 20:10:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 716 states have (on average 1.3589385474860336) internal successors, (973), 718 states have internal predecessors, (973), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 997 transitions. [2024-11-12 20:10:46,679 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 997 transitions. Word has length 188 [2024-11-12 20:10:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:46,679 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 997 transitions. [2024-11-12 20:10:46,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 14.25) internal successors, (171), 12 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 997 transitions. [2024-11-12 20:10:46,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 20:10:46,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:46,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:46,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 20:10:46,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 20:10:46,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:46,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:46,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1203961189, now seen corresponding path program 1 times [2024-11-12 20:10:46,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:46,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565559014] [2024-11-12 20:10:46,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:46,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 20:10:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 20:10:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:47,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:47,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565559014] [2024-11-12 20:10:47,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565559014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:47,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:47,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 20:10:47,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607580183] [2024-11-12 20:10:47,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:47,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:10:47,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:47,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:10:47,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 20:10:47,061 INFO L87 Difference]: Start difference. First operand 732 states and 997 transitions. Second operand has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:47,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:47,296 INFO L93 Difference]: Finished difference Result 1378 states and 1891 transitions. [2024-11-12 20:10:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:10:47,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-12 20:10:47,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:47,299 INFO L225 Difference]: With dead ends: 1378 [2024-11-12 20:10:47,299 INFO L226 Difference]: Without dead ends: 749 [2024-11-12 20:10:47,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-11-12 20:10:47,301 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 5 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:47,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1316 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2024-11-12 20:10:47,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 742. [2024-11-12 20:10:47,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 726 states have (on average 1.3484848484848484) internal successors, (979), 728 states have internal predecessors, (979), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:47,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1003 transitions. [2024-11-12 20:10:47,315 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1003 transitions. Word has length 188 [2024-11-12 20:10:47,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:47,316 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1003 transitions. [2024-11-12 20:10:47,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.75) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1003 transitions. [2024-11-12 20:10:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 20:10:47,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:47,317 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:47,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 20:10:47,317 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -467473893, now seen corresponding path program 1 times [2024-11-12 20:10:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773835922] [2024-11-12 20:10:47,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:47,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 20:10:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 20:10:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 20:10:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 20:10:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:47,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773835922] [2024-11-12 20:10:47,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773835922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:47,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:47,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 20:10:47,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582369513] [2024-11-12 20:10:47,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:47,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:10:47,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:47,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:10:47,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 20:10:47,505 INFO L87 Difference]: Start difference. First operand 742 states and 1003 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:47,736 INFO L93 Difference]: Finished difference Result 1313 states and 1779 transitions. [2024-11-12 20:10:47,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 20:10:47,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 188 [2024-11-12 20:10:47,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:47,738 INFO L225 Difference]: With dead ends: 1313 [2024-11-12 20:10:47,738 INFO L226 Difference]: Without dead ends: 605 [2024-11-12 20:10:47,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 20:10:47,740 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 12 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:47,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1436 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-12 20:10:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2024-11-12 20:10:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 586 states have (on average 1.3122866894197953) internal successors, (769), 588 states have internal predecessors, (769), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 793 transitions. [2024-11-12 20:10:47,752 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 793 transitions. Word has length 188 [2024-11-12 20:10:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:47,752 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 793 transitions. [2024-11-12 20:10:47,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 4 states have internal predecessors, (171), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 793 transitions. [2024-11-12 20:10:47,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 20:10:47,753 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:47,753 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:47,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 20:10:47,754 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:47,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1206171199, now seen corresponding path program 1 times [2024-11-12 20:10:47,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:47,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338090068] [2024-11-12 20:10:47,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:47,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 20:10:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 20:10:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 20:10:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:10:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:10:48,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338090068] [2024-11-12 20:10:48,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338090068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:48,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572041753] [2024-11-12 20:10:48,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:48,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:48,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:48,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:48,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 20:10:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:48,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-12 20:10:48,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:48,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:48,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572041753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:48,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:48,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-12 20:10:48,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414408176] [2024-11-12 20:10:48,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 20:10:48,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:48,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 20:10:48,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:48,833 INFO L87 Difference]: Start difference. First operand 602 states and 793 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:48,923 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2024-11-12 20:10:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 20:10:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 189 [2024-11-12 20:10:48,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:48,925 INFO L225 Difference]: With dead ends: 1164 [2024-11-12 20:10:48,925 INFO L226 Difference]: Without dead ends: 602 [2024-11-12 20:10:48,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:48,927 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 13 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:48,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1051 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 20:10:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2024-11-12 20:10:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2024-11-12 20:10:48,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 586 states have (on average 1.3088737201365188) internal successors, (767), 588 states have internal predecessors, (767), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:48,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 791 transitions. [2024-11-12 20:10:48,939 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 791 transitions. Word has length 189 [2024-11-12 20:10:48,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:48,939 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 791 transitions. [2024-11-12 20:10:48,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:48,939 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 791 transitions. [2024-11-12 20:10:48,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 20:10:48,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:48,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:48,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 20:10:49,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:49,142 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:49,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1619811980, now seen corresponding path program 1 times [2024-11-12 20:10:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851706834] [2024-11-12 20:10:49,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:49,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 20:10:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 20:10:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 20:10:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:10:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:49,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:49,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851706834] [2024-11-12 20:10:49,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851706834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:49,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 20:10:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780325360] [2024-11-12 20:10:49,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:49,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:10:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:10:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:49,568 INFO L87 Difference]: Start difference. First operand 602 states and 791 transitions. Second operand has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:50,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:50,022 INFO L93 Difference]: Finished difference Result 1170 states and 1561 transitions. [2024-11-12 20:10:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:10:50,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 190 [2024-11-12 20:10:50,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:50,025 INFO L225 Difference]: With dead ends: 1170 [2024-11-12 20:10:50,025 INFO L226 Difference]: Without dead ends: 611 [2024-11-12 20:10:50,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:50,027 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 7 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:50,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1959 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:10:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2024-11-12 20:10:50,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 608. [2024-11-12 20:10:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 592 states have (on average 1.3057432432432432) internal successors, (773), 594 states have internal predecessors, (773), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 797 transitions. [2024-11-12 20:10:50,042 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 797 transitions. Word has length 190 [2024-11-12 20:10:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:50,042 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 797 transitions. [2024-11-12 20:10:50,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.714285714285715) internal successors, (173), 6 states have internal predecessors, (173), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 797 transitions. [2024-11-12 20:10:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 20:10:50,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:50,044 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:50,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 20:10:50,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:50,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:50,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1283726526, now seen corresponding path program 1 times [2024-11-12 20:10:50,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:50,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551191722] [2024-11-12 20:10:50,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:50,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:50,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:50,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:10:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 20:10:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 20:10:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:10:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551191722] [2024-11-12 20:10:50,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551191722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:50,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758937560] [2024-11-12 20:10:50,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:50,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:50,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:50,525 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:50,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 20:10:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:51,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 20:10:51,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 20:10:51,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758937560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2024-11-12 20:10:51,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551040378] [2024-11-12 20:10:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:10:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:51,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:10:51,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:10:51,315 INFO L87 Difference]: Start difference. First operand 608 states and 797 transitions. Second operand has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:51,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:51,508 INFO L93 Difference]: Finished difference Result 1037 states and 1372 transitions. [2024-11-12 20:10:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:10:51,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 191 [2024-11-12 20:10:51,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:51,510 INFO L225 Difference]: With dead ends: 1037 [2024-11-12 20:10:51,511 INFO L226 Difference]: Without dead ends: 618 [2024-11-12 20:10:51,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:10:51,511 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 12 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:51,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1704 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2024-11-12 20:10:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 616. [2024-11-12 20:10:51,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 600 states have (on average 1.3016666666666667) internal successors, (781), 602 states have internal predecessors, (781), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:51,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 805 transitions. [2024-11-12 20:10:51,521 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 805 transitions. Word has length 191 [2024-11-12 20:10:51,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:51,522 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 805 transitions. [2024-11-12 20:10:51,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.285714285714285) internal successors, (177), 7 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 805 transitions. [2024-11-12 20:10:51,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-12 20:10:51,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:51,523 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:51,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 20:10:51,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:51,724 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash 979086026, now seen corresponding path program 1 times [2024-11-12 20:10:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809586495] [2024-11-12 20:10:51,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:51,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:10:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 20:10:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 20:10:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:52,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:52,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809586495] [2024-11-12 20:10:52,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809586495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:52,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:52,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 20:10:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075208890] [2024-11-12 20:10:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:52,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 20:10:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:52,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 20:10:52,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 20:10:52,145 INFO L87 Difference]: Start difference. First operand 616 states and 805 transitions. Second operand has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:52,594 INFO L93 Difference]: Finished difference Result 1054 states and 1399 transitions. [2024-11-12 20:10:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:10:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 192 [2024-11-12 20:10:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:52,597 INFO L225 Difference]: With dead ends: 1054 [2024-11-12 20:10:52,597 INFO L226 Difference]: Without dead ends: 641 [2024-11-12 20:10:52,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:10:52,598 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 24 mSDsluCounter, 2168 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:52,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2550 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:10:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2024-11-12 20:10:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 624. [2024-11-12 20:10:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 608 states have (on average 1.300986842105263) internal successors, (791), 610 states have internal predecessors, (791), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 815 transitions. [2024-11-12 20:10:52,610 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 815 transitions. Word has length 192 [2024-11-12 20:10:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:52,611 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 815 transitions. [2024-11-12 20:10:52,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.444444444444443) internal successors, (175), 8 states have internal predecessors, (175), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:52,611 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 815 transitions. [2024-11-12 20:10:52,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 20:10:52,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:52,612 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:52,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 20:10:52,613 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:52,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 46585938, now seen corresponding path program 1 times [2024-11-12 20:10:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379071109] [2024-11-12 20:10:52,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:52,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:53,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:53,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:10:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 20:10:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 20:10:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379071109] [2024-11-12 20:10:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379071109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:53,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 20:10:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700682828] [2024-11-12 20:10:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:53,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 20:10:53,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:53,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:10:53,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:10:53,142 INFO L87 Difference]: Start difference. First operand 624 states and 815 transitions. Second operand has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:53,704 INFO L93 Difference]: Finished difference Result 1071 states and 1422 transitions. [2024-11-12 20:10:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:10:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-12 20:10:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:53,726 INFO L225 Difference]: With dead ends: 1071 [2024-11-12 20:10:53,726 INFO L226 Difference]: Without dead ends: 649 [2024-11-12 20:10:53,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:10:53,727 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 35 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:53,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2974 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:10:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-12 20:10:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 640. [2024-11-12 20:10:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 624 states have (on average 1.2996794871794872) internal successors, (811), 626 states have internal predecessors, (811), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 835 transitions. [2024-11-12 20:10:53,744 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 835 transitions. Word has length 193 [2024-11-12 20:10:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:53,745 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 835 transitions. [2024-11-12 20:10:53,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.6) internal successors, (176), 9 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 835 transitions. [2024-11-12 20:10:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-12 20:10:53,747 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:53,747 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:53,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 20:10:53,747 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:53,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1156914087, now seen corresponding path program 1 times [2024-11-12 20:10:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:53,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154639923] [2024-11-12 20:10:53,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:53,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:10:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 20:10:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 20:10:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:10:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:54,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154639923] [2024-11-12 20:10:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154639923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 20:10:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171294615] [2024-11-12 20:10:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:54,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:10:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:10:54,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:10:54,198 INFO L87 Difference]: Start difference. First operand 640 states and 835 transitions. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:54,546 INFO L93 Difference]: Finished difference Result 1085 states and 1437 transitions. [2024-11-12 20:10:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:10:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 193 [2024-11-12 20:10:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:54,549 INFO L225 Difference]: With dead ends: 1085 [2024-11-12 20:10:54,549 INFO L226 Difference]: Without dead ends: 653 [2024-11-12 20:10:54,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:10:54,550 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 19 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 1963 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:10:54,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-12 20:10:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 646. [2024-11-12 20:10:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 630 states have (on average 1.2968253968253969) internal successors, (817), 632 states have internal predecessors, (817), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 20:10:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 841 transitions. [2024-11-12 20:10:54,561 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 841 transitions. Word has length 193 [2024-11-12 20:10:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:54,561 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 841 transitions. [2024-11-12 20:10:54,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 7 states have internal predecessors, (176), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 841 transitions. [2024-11-12 20:10:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 20:10:54,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:54,563 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:54,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 20:10:54,563 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:54,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:54,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1432850503, now seen corresponding path program 1 times [2024-11-12 20:10:54,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:54,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317873012] [2024-11-12 20:10:54,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 20:10:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 20:10:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 20:10:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 20:10:54,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317873012] [2024-11-12 20:10:54,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317873012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:54,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231793289] [2024-11-12 20:10:54,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:54,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 20:10:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:55,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 20:10:55,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 20:10:55,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231793289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:55,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:55,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-12 20:10:55,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238102103] [2024-11-12 20:10:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 20:10:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 20:10:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:55,511 INFO L87 Difference]: Start difference. First operand 646 states and 841 transitions. Second operand has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:55,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:55,571 INFO L93 Difference]: Finished difference Result 1202 states and 1578 transitions. [2024-11-12 20:10:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 20:10:55,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 194 [2024-11-12 20:10:55,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:55,573 INFO L225 Difference]: With dead ends: 1202 [2024-11-12 20:10:55,573 INFO L226 Difference]: Without dead ends: 649 [2024-11-12 20:10:55,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 20:10:55,575 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 368 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:55,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1679 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 20:10:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-12 20:10:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 649. [2024-11-12 20:10:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 632 states have (on average 1.2974683544303798) internal successors, (820), 635 states have internal predecessors, (820), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:10:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 848 transitions. [2024-11-12 20:10:55,600 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 848 transitions. Word has length 194 [2024-11-12 20:10:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:55,600 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 848 transitions. [2024-11-12 20:10:55,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.6) internal successors, (183), 5 states have internal predecessors, (183), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 20:10:55,601 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 848 transitions. [2024-11-12 20:10:55,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 20:10:55,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:55,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:55,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-12 20:10:55,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 20:10:55,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:55,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:55,803 INFO L85 PathProgramCache]: Analyzing trace with hash 882175431, now seen corresponding path program 1 times [2024-11-12 20:10:55,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:55,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938320154] [2024-11-12 20:10:55,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:55,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 20:10:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:10:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 20:10:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:10:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938320154] [2024-11-12 20:10:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938320154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260827496] [2024-11-12 20:10:56,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:56,366 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:56,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 20:10:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:56,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 20:10:56,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:10:57,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260827496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:57,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-12 20:10:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727517675] [2024-11-12 20:10:57,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:10:57,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:10:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:10:57,146 INFO L87 Difference]: Start difference. First operand 649 states and 848 transitions. Second operand has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:57,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:57,355 INFO L93 Difference]: Finished difference Result 1255 states and 1652 transitions. [2024-11-12 20:10:57,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:10:57,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 198 [2024-11-12 20:10:57,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:57,357 INFO L225 Difference]: With dead ends: 1255 [2024-11-12 20:10:57,358 INFO L226 Difference]: Without dead ends: 659 [2024-11-12 20:10:57,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:10:57,359 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 8 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1964 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:57,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1964 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:10:57,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-12 20:10:57,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 657. [2024-11-12 20:10:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 640 states have (on average 1.296875) internal successors, (830), 643 states have internal predecessors, (830), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:10:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 858 transitions. [2024-11-12 20:10:57,377 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 858 transitions. Word has length 198 [2024-11-12 20:10:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:57,377 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 858 transitions. [2024-11-12 20:10:57,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 858 transitions. [2024-11-12 20:10:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 20:10:57,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:57,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:57,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 20:10:57,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:57,580 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:57,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:57,580 INFO L85 PathProgramCache]: Analyzing trace with hash -142962901, now seen corresponding path program 1 times [2024-11-12 20:10:57,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:57,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771349453] [2024-11-12 20:10:57,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:57,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 20:10:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 20:10:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:57,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 20:10:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 20:10:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:10:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771349453] [2024-11-12 20:10:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771349453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:57,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:10:57,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 20:10:57,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043059785] [2024-11-12 20:10:57,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:57,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:10:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:57,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:10:57,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:10:57,933 INFO L87 Difference]: Start difference. First operand 657 states and 858 transitions. Second operand has 8 states, 8 states have (on average 22.25) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:10:58,474 INFO L93 Difference]: Finished difference Result 1267 states and 1667 transitions. [2024-11-12 20:10:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:10:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 198 [2024-11-12 20:10:58,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:10:58,477 INFO L225 Difference]: With dead ends: 1267 [2024-11-12 20:10:58,477 INFO L226 Difference]: Without dead ends: 667 [2024-11-12 20:10:58,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 20:10:58,479 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 11 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:10:58,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2265 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:10:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-12 20:10:58,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 657. [2024-11-12 20:10:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 640 states have (on average 1.296875) internal successors, (830), 643 states have internal predecessors, (830), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:10:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 858 transitions. [2024-11-12 20:10:58,495 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 858 transitions. Word has length 198 [2024-11-12 20:10:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:10:58,495 INFO L471 AbstractCegarLoop]: Abstraction has 657 states and 858 transitions. [2024-11-12 20:10:58,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.25) internal successors, (178), 7 states have internal predecessors, (178), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:10:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 858 transitions. [2024-11-12 20:10:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 20:10:58,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:10:58,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:10:58,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 20:10:58,497 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:10:58,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:10:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1170566881, now seen corresponding path program 1 times [2024-11-12 20:10:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:10:58,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373359583] [2024-11-12 20:10:58,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:58,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:10:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 20:10:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 20:10:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:10:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 20:10:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:10:59,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:10:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373359583] [2024-11-12 20:10:59,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373359583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:10:59,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018896341] [2024-11-12 20:10:59,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:10:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:10:59,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:10:59,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:10:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 20:10:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:10:59,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 20:10:59,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:10:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:10:59,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:10:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018896341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:10:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:10:59,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2024-11-12 20:10:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112130011] [2024-11-12 20:10:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:10:59,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 20:10:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:10:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 20:10:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:10:59,858 INFO L87 Difference]: Start difference. First operand 657 states and 858 transitions. Second operand has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:03,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 20:11:05,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 20:11:05,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:05,554 INFO L93 Difference]: Finished difference Result 1272 states and 1671 transitions. [2024-11-12 20:11:05,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:11:05,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 199 [2024-11-12 20:11:05,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:05,556 INFO L225 Difference]: With dead ends: 1272 [2024-11-12 20:11:05,556 INFO L226 Difference]: Without dead ends: 677 [2024-11-12 20:11:05,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-12 20:11:05,558 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 13 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:05,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2297 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-12 20:11:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-12 20:11:05,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 667. [2024-11-12 20:11:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 650 states have (on average 1.2953846153846154) internal successors, (842), 653 states have internal predecessors, (842), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 870 transitions. [2024-11-12 20:11:05,572 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 870 transitions. Word has length 199 [2024-11-12 20:11:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:05,572 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 870 transitions. [2024-11-12 20:11:05,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.375) internal successors, (179), 8 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:05,572 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 870 transitions. [2024-11-12 20:11:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 20:11:05,573 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:05,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:05,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-12 20:11:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:05,774 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:05,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:05,775 INFO L85 PathProgramCache]: Analyzing trace with hash -543950339, now seen corresponding path program 1 times [2024-11-12 20:11:05,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:05,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838907159] [2024-11-12 20:11:05,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:06,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 20:11:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 20:11:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:06,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-12 20:11:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 20:11:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:11:06,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838907159] [2024-11-12 20:11:06,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838907159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:06,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 20:11:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110780856] [2024-11-12 20:11:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:06,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 20:11:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 20:11:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:11:06,166 INFO L87 Difference]: Start difference. First operand 667 states and 870 transitions. Second operand has 10 states, 10 states have (on average 17.9) internal successors, (179), 9 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:06,551 INFO L93 Difference]: Finished difference Result 1287 states and 1689 transitions. [2024-11-12 20:11:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 20:11:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 9 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 199 [2024-11-12 20:11:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:06,553 INFO L225 Difference]: With dead ends: 1287 [2024-11-12 20:11:06,554 INFO L226 Difference]: Without dead ends: 687 [2024-11-12 20:11:06,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-12 20:11:06,555 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 19 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:06,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2380 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 20:11:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-12 20:11:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2024-11-12 20:11:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 664 states have (on average 1.2951807228915662) internal successors, (860), 667 states have internal predecessors, (860), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:06,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 888 transitions. [2024-11-12 20:11:06,568 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 888 transitions. Word has length 199 [2024-11-12 20:11:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 888 transitions. [2024-11-12 20:11:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.9) internal successors, (179), 9 states have internal predecessors, (179), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 888 transitions. [2024-11-12 20:11:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 20:11:06,570 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:06,570 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:06,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 20:11:06,570 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:06,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:06,570 INFO L85 PathProgramCache]: Analyzing trace with hash -463795597, now seen corresponding path program 1 times [2024-11-12 20:11:06,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:06,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667204403] [2024-11-12 20:11:06,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:06,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:07,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 20:11:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:07,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 20:11:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:07,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 20:11:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:11:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667204403] [2024-11-12 20:11:07,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667204403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:07,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463536438] [2024-11-12 20:11:07,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:07,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:07,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:07,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:07,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 20:11:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:08,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 20:11:08,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:11:09,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463536438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:09,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-12 20:11:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791467535] [2024-11-12 20:11:09,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:09,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:11:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:09,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:11:09,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:11:09,221 INFO L87 Difference]: Start difference. First operand 681 states and 888 transitions. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:09,940 INFO L93 Difference]: Finished difference Result 1293 states and 1695 transitions. [2024-11-12 20:11:09,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:11:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 200 [2024-11-12 20:11:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:09,943 INFO L225 Difference]: With dead ends: 1293 [2024-11-12 20:11:09,944 INFO L226 Difference]: Without dead ends: 681 [2024-11-12 20:11:09,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:11:09,945 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 7 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:09,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3240 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 20:11:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-12 20:11:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2024-11-12 20:11:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 660 states have (on average 1.293939393939394) internal successors, (854), 663 states have internal predecessors, (854), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 882 transitions. [2024-11-12 20:11:09,955 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 882 transitions. Word has length 200 [2024-11-12 20:11:09,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:09,956 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 882 transitions. [2024-11-12 20:11:09,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 11 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:09,956 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 882 transitions. [2024-11-12 20:11:09,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 20:11:09,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:09,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:09,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 20:11:10,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-12 20:11:10,158 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:10,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash -887582221, now seen corresponding path program 1 times [2024-11-12 20:11:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964577275] [2024-11-12 20:11:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:10,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 20:11:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 20:11:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 20:11:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:11:10,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964577275] [2024-11-12 20:11:10,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964577275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:10,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547957463] [2024-11-12 20:11:10,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:10,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:10,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:10,963 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:10,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 20:11:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:11,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 20:11:11,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-12 20:11:11,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547957463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:11,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-12 20:11:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656527315] [2024-11-12 20:11:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:11,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:11:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:11,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:11:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:11:11,641 INFO L87 Difference]: Start difference. First operand 677 states and 882 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:11,829 INFO L93 Difference]: Finished difference Result 1292 states and 1695 transitions. [2024-11-12 20:11:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 20:11:11,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 200 [2024-11-12 20:11:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:11,831 INFO L225 Difference]: With dead ends: 1292 [2024-11-12 20:11:11,831 INFO L226 Difference]: Without dead ends: 687 [2024-11-12 20:11:11,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:11:11,832 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 31 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:11,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1982 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:11:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-12 20:11:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 681. [2024-11-12 20:11:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 664 states have (on average 1.2921686746987953) internal successors, (858), 667 states have internal predecessors, (858), 12 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 886 transitions. [2024-11-12 20:11:11,860 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 886 transitions. Word has length 200 [2024-11-12 20:11:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 886 transitions. [2024-11-12 20:11:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 886 transitions. [2024-11-12 20:11:11,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 20:11:11,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:11,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:11,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-12 20:11:12,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-12 20:11:12,063 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:12,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 173894156, now seen corresponding path program 1 times [2024-11-12 20:11:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778708946] [2024-11-12 20:11:12,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:12,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 20:11:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 20:11:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-12 20:11:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:11:12,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778708946] [2024-11-12 20:11:12,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778708946] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:12,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027174310] [2024-11-12 20:11:12,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:12,690 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:12,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-12 20:11:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:13,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 1091 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 20:11:13,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-12 20:11:13,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:11:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-12 20:11:13,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027174310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:11:13,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:11:13,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 15 [2024-11-12 20:11:13,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573797727] [2024-11-12 20:11:13,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:11:13,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 20:11:13,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:13,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 20:11:13,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:11:13,997 INFO L87 Difference]: Start difference. First operand 681 states and 886 transitions. Second operand has 15 states, 15 states have (on average 24.466666666666665) internal successors, (367), 14 states have internal predecessors, (367), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 20:11:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:14,354 INFO L93 Difference]: Finished difference Result 1264 states and 1665 transitions. [2024-11-12 20:11:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 20:11:14,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 24.466666666666665) internal successors, (367), 14 states have internal predecessors, (367), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 200 [2024-11-12 20:11:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:14,357 INFO L225 Difference]: With dead ends: 1264 [2024-11-12 20:11:14,357 INFO L226 Difference]: Without dead ends: 690 [2024-11-12 20:11:14,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2024-11-12 20:11:14,359 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 312 mSDsluCounter, 2859 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:14,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 3292 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:11:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-11-12 20:11:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 690. [2024-11-12 20:11:14,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 672 states have (on average 1.2946428571428572) internal successors, (870), 675 states have internal predecessors, (870), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 898 transitions. [2024-11-12 20:11:14,370 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 898 transitions. Word has length 200 [2024-11-12 20:11:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:14,370 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 898 transitions. [2024-11-12 20:11:14,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 24.466666666666665) internal successors, (367), 14 states have internal predecessors, (367), 4 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-12 20:11:14,371 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 898 transitions. [2024-11-12 20:11:14,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 20:11:14,372 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:14,372 INFO L218 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:14,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-12 20:11:14,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-12 20:11:14,573 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:14,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 768413772, now seen corresponding path program 2 times [2024-11-12 20:11:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102505478] [2024-11-12 20:11:14,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 20:11:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-12 20:11:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 20:11:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 5 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 20:11:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102505478] [2024-11-12 20:11:15,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102505478] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:15,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333002740] [2024-11-12 20:11:15,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:11:15,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:15,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:15,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:15,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-12 20:11:16,025 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:11:16,025 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:11:16,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 20:11:16,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:16,117 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 84 proven. 25 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-12 20:11:16,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:11:16,257 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 22 proven. 31 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-12 20:11:16,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333002740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:11:16,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:11:16,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 6] total 20 [2024-11-12 20:11:16,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464884198] [2024-11-12 20:11:16,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:11:16,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 20:11:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:16,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 20:11:16,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-12 20:11:16,259 INFO L87 Difference]: Start difference. First operand 690 states and 898 transitions. Second operand has 20 states, 20 states have (on average 10.5) internal successors, (210), 19 states have internal predecessors, (210), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 20:11:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:16,699 INFO L93 Difference]: Finished difference Result 1286 states and 1704 transitions. [2024-11-12 20:11:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-12 20:11:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 10.5) internal successors, (210), 19 states have internal predecessors, (210), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 208 [2024-11-12 20:11:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:16,702 INFO L225 Difference]: With dead ends: 1286 [2024-11-12 20:11:16,702 INFO L226 Difference]: Without dead ends: 701 [2024-11-12 20:11:16,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2024-11-12 20:11:16,703 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 34 mSDsluCounter, 3700 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4083 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:16,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4083 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 20:11:16,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-12 20:11:16,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 697. [2024-11-12 20:11:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 679 states have (on average 1.2974963181148749) internal successors, (881), 682 states have internal predecessors, (881), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 909 transitions. [2024-11-12 20:11:16,719 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 909 transitions. Word has length 208 [2024-11-12 20:11:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:16,719 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 909 transitions. [2024-11-12 20:11:16,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 10.5) internal successors, (210), 19 states have internal predecessors, (210), 2 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-12 20:11:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 909 transitions. [2024-11-12 20:11:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-12 20:11:16,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:16,720 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:16,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-12 20:11:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-12 20:11:16,921 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:16,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1230175878, now seen corresponding path program 3 times [2024-11-12 20:11:16,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:16,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515535341] [2024-11-12 20:11:16,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:16,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:17,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 20:11:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 20:11:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 20:11:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-12 20:11:18,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:18,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515535341] [2024-11-12 20:11:18,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515535341] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:18,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140749742] [2024-11-12 20:11:18,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 20:11:18,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:18,126 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:18,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-12 20:11:19,011 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 20:11:19,011 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:11:19,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 20:11:19,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2024-11-12 20:11:19,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 20:11:19,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140749742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:19,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 20:11:19,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-11-12 20:11:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897538602] [2024-11-12 20:11:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 20:11:19,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 20:11:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:11:19,159 INFO L87 Difference]: Start difference. First operand 697 states and 909 transitions. Second operand has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:19,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:19,388 INFO L93 Difference]: Finished difference Result 1335 states and 1755 transitions. [2024-11-12 20:11:19,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 20:11:19,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 222 [2024-11-12 20:11:19,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:19,391 INFO L225 Difference]: With dead ends: 1335 [2024-11-12 20:11:19,391 INFO L226 Difference]: Without dead ends: 707 [2024-11-12 20:11:19,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-12 20:11:19,392 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 6 mSDsluCounter, 1585 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:19,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1971 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 20:11:19,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-12 20:11:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 697. [2024-11-12 20:11:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 679 states have (on average 1.2974963181148749) internal successors, (881), 682 states have internal predecessors, (881), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 909 transitions. [2024-11-12 20:11:19,420 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 909 transitions. Word has length 222 [2024-11-12 20:11:19,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:19,420 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 909 transitions. [2024-11-12 20:11:19,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.714285714285715) internal successors, (180), 7 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:19,420 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 909 transitions. [2024-11-12 20:11:19,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-12 20:11:19,421 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:19,421 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:19,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-12 20:11:19,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-12 20:11:19,622 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1484651793, now seen corresponding path program 1 times [2024-11-12 20:11:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:19,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717618987] [2024-11-12 20:11:19,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 20:11:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:20,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 20:11:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 20:11:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 20:11:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2024-11-12 20:11:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717618987] [2024-11-12 20:11:20,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717618987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 20:11:20,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 20:11:20,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 20:11:20,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550003559] [2024-11-12 20:11:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 20:11:20,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 20:11:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 20:11:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-12 20:11:20,099 INFO L87 Difference]: Start difference. First operand 697 states and 909 transitions. Second operand has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 10 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:20,617 INFO L93 Difference]: Finished difference Result 1345 states and 1770 transitions. [2024-11-12 20:11:20,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 20:11:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 10 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 222 [2024-11-12 20:11:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:20,620 INFO L225 Difference]: With dead ends: 1345 [2024-11-12 20:11:20,620 INFO L226 Difference]: Without dead ends: 717 [2024-11-12 20:11:20,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-12 20:11:20,621 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 25 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:20,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2664 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 20:11:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-11-12 20:11:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 703. [2024-11-12 20:11:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 685 states have (on average 1.294890510948905) internal successors, (887), 688 states have internal predecessors, (887), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:20,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 915 transitions. [2024-11-12 20:11:20,633 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 915 transitions. Word has length 222 [2024-11-12 20:11:20,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:20,633 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 915 transitions. [2024-11-12 20:11:20,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.363636363636363) internal successors, (180), 10 states have internal predecessors, (180), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-12 20:11:20,633 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 915 transitions. [2024-11-12 20:11:20,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-12 20:11:20,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:20,634 INFO L218 NwaCegarLoop]: trace histogram [26, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-12 20:11:20,635 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:20,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:20,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1617913602, now seen corresponding path program 1 times [2024-11-12 20:11:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137770737] [2024-11-12 20:11:20,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:11:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:21,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-12 20:11:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:21,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 20:11:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 20:11:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 5 proven. 165 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-12 20:11:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137770737] [2024-11-12 20:11:21,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137770737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:21,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228621933] [2024-11-12 20:11:21,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:21,348 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:21,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-12 20:11:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:22,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 1419 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-12 20:11:22,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 208 proven. 195 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 20:11:22,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 20:11:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 99 proven. 71 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-11-12 20:11:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228621933] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 20:11:22,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 20:11:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 9] total 27 [2024-11-12 20:11:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811781326] [2024-11-12 20:11:22,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 20:11:22,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-12 20:11:22,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 20:11:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-12 20:11:22,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2024-11-12 20:11:22,708 INFO L87 Difference]: Start difference. First operand 703 states and 915 transitions. Second operand has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 2 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 20:11:24,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 20:11:24,118 INFO L93 Difference]: Finished difference Result 1321 states and 1745 transitions. [2024-11-12 20:11:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-12 20:11:24,119 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 2 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 223 [2024-11-12 20:11:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 20:11:24,121 INFO L225 Difference]: With dead ends: 1321 [2024-11-12 20:11:24,121 INFO L226 Difference]: Without dead ends: 724 [2024-11-12 20:11:24,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=686, Invalid=2854, Unknown=0, NotChecked=0, Total=3540 [2024-11-12 20:11:24,123 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 34 mSDsluCounter, 5365 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5759 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 20:11:24,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5759 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 20:11:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2024-11-12 20:11:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 719. [2024-11-12 20:11:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 701 states have (on average 1.2838801711840229) internal successors, (900), 703 states have internal predecessors, (900), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-12 20:11:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 928 transitions. [2024-11-12 20:11:24,135 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 928 transitions. Word has length 223 [2024-11-12 20:11:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 20:11:24,135 INFO L471 AbstractCegarLoop]: Abstraction has 719 states and 928 transitions. [2024-11-12 20:11:24,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 2 states have call successors, (9), 3 states have call predecessors, (9), 6 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-12 20:11:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 928 transitions. [2024-11-12 20:11:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-12 20:11:24,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 20:11:24,136 INFO L218 NwaCegarLoop]: trace histogram [46, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 20:11:24,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-12 20:11:24,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-12 20:11:24,337 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 20:11:24,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 20:11:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash 692476222, now seen corresponding path program 2 times [2024-11-12 20:11:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 20:11:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442365541] [2024-11-12 20:11:24,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 20:11:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 20:11:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 20:11:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-12 20:11:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 20:11:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-12 20:11:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 20:11:25,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 5 proven. 670 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-12 20:11:25,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 20:11:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442365541] [2024-11-12 20:11:25,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442365541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 20:11:25,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535853683] [2024-11-12 20:11:25,648 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 20:11:25,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 20:11:25,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 20:11:25,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 20:11:25,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-12 20:11:27,041 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 20:11:27,041 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 20:11:27,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 1719 conjuncts, 326 conjuncts are in the unsatisfiable core [2024-11-12 20:11:27,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 20:11:27,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 20:11:27,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:11:27,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 11 [2024-11-12 20:11:27,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-12 20:11:27,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 20:11:27,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 20:11:27,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-12 20:11:27,459 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2024-11-12 20:11:27,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2024-11-12 20:11:27,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-12 20:11:27,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:11:27,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-12 20:11:27,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-12 20:11:27,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 57 [2024-11-12 20:11:27,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:11:27,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-12 20:11:35,695 INFO L224 Elim1Store]: Index analysis took 190 ms