./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 023d838f 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/list-simple/dll2c_insert_unequal.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 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:51:06,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:51:06,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-10 18:51:06,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:51:06,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:51:06,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:51:06,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:51:06,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:51:06,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:51:06,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:51:06,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:51:06,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:51:06,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:51:06,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:51:06,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:51:06,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:51:06,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 18:51:06,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:51:06,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:51:06,581 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:51:06,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:51:06,583 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 18:51:06,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:51:06,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 18:51:06,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:51:06,585 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-10 18:51:06,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:51:06,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:51:06,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 18:51:06,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:51:06,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:51:06,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:51:06,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:51:06,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:51:06,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:51:06,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:51:06,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:51:06,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 18:51:06,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:51:06,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:51:06,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:51:06,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:51:06,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:51:06,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:51:06,589 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 -> 1b81f923e96224472f8219a473f794261ff02356a47c6b09b527f0fc600725a8 [2024-11-10 18:51:06,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:51:06,814 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:51:06,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:51:06,817 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:51:06,817 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:51:06,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-10 18:51:08,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:51:08,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:51:08,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2024-11-10 18:51:08,458 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f87ba43/3867f9ae079e4f539320b96d189d7dc4/FLAGfe5528b45 [2024-11-10 18:51:08,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98f87ba43/3867f9ae079e4f539320b96d189d7dc4 [2024-11-10 18:51:08,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:51:08,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:51:08,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:51:08,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:51:08,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:51:08,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78fabf00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08, skipping insertion in model container [2024-11-10 18:51:08,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,514 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:51:08,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:51:08,806 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:51:08,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:51:08,885 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:51:08,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08 WrapperNode [2024-11-10 18:51:08,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:51:08,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:51:08,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:51:08,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:51:08,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,932 INFO L138 Inliner]: procedures = 127, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 198 [2024-11-10 18:51:08,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:51:08,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:51:08,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:51:08,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:51:08,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,977 INFO L175 MemorySlicer]: Split 40 memory accesses to 3 slices as follows [2, 26, 12]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 18 writes are split as follows [0, 17, 1]. [2024-11-10 18:51:08,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:08,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:51:09,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:51:09,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:51:09,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:51:09,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (1/1) ... [2024-11-10 18:51:09,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:51:09,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:09,027 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-10 18:51:09,030 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-10 18:51:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:51:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:51:09,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-10 18:51:09,066 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:51:09,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 18:51:09,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 18:51:09,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 18:51:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:51:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:51:09,195 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:51:09,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:51:09,388 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-10 18:51:09,402 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-10 18:51:09,426 INFO L? ?]: Removed 82 outVars from TransFormulas that were not future-live. [2024-11-10 18:51:09,427 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:51:09,441 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:51:09,444 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:51:09,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:09 BoogieIcfgContainer [2024-11-10 18:51:09,445 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:51:09,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:51:09,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:51:09,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:51:09,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:51:08" (1/3) ... [2024-11-10 18:51:09,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537c232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:09, skipping insertion in model container [2024-11-10 18:51:09,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:51:08" (2/3) ... [2024-11-10 18:51:09,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537c232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:51:09, skipping insertion in model container [2024-11-10 18:51:09,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:51:09" (3/3) ... [2024-11-10 18:51:09,457 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2024-11-10 18:51:09,473 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:51:09,474 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-10 18:51:09,520 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:51:09,524 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;@3a7876ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:51:09,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-10 18:51:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 75 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 18:51:09,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:09,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:09,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash 94489857, now seen corresponding path program 1 times [2024-11-10 18:51:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:09,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497068314] [2024-11-10 18:51:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:09,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:09,738 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-10 18:51:09,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497068314] [2024-11-10 18:51:09,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497068314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:09,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:09,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:51:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386917871] [2024-11-10 18:51:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:51:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:09,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:51:09,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:51:09,763 INFO L87 Difference]: Start difference. First operand has 80 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 75 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:09,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:09,849 INFO L93 Difference]: Finished difference Result 144 states and 181 transitions. [2024-11-10 18:51:09,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:51:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 18:51:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:09,856 INFO L225 Difference]: With dead ends: 144 [2024-11-10 18:51:09,856 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 18:51:09,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:51:09,878 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:09,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 18:51:09,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-10 18:51:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 62 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:09,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2024-11-10 18:51:09,907 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 13 [2024-11-10 18:51:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:09,908 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2024-11-10 18:51:09,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2024-11-10 18:51:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 18:51:09,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:09,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:09,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:51:09,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:09,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:09,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1366375507, now seen corresponding path program 1 times [2024-11-10 18:51:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:09,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012464803] [2024-11-10 18:51:09,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,043 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-10 18:51:10,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012464803] [2024-11-10 18:51:10,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012464803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:10,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:10,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958329984] [2024-11-10 18:51:10,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:10,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:51:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:10,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:51:10,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:51:10,046 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:10,093 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2024-11-10 18:51:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:51:10,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 18:51:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:10,094 INFO L225 Difference]: With dead ends: 125 [2024-11-10 18:51:10,094 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 18:51:10,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10 18:51:10,095 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 4 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:10,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 191 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 18:51:10,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2024-11-10 18:51:10,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.392156862745098) internal successors, (71), 64 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:10,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-10 18:51:10,102 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 14 [2024-11-10 18:51:10,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-10 18:51:10,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 18:51:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-10 18:51:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 18:51:10,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:10,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:10,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:51:10,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:10,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:10,104 INFO L85 PathProgramCache]: Analyzing trace with hash -295206073, now seen corresponding path program 1 times [2024-11-10 18:51:10,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:10,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623477058] [2024-11-10 18:51:10,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:10,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:51:10,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:10,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623477058] [2024-11-10 18:51:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623477058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:10,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:10,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:10,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640715734] [2024-11-10 18:51:10,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:10,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:10,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:10,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:51:10,252 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10 18:51:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:10,316 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2024-11-10 18:51:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:10,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 21 [2024-11-10 18:51:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:10,318 INFO L225 Difference]: With dead ends: 77 [2024-11-10 18:51:10,318 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 18:51:10,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10 18:51:10,319 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:10,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 245 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 18:51:10,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2024-11-10 18:51:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 68 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:51:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2024-11-10 18:51:10,331 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 21 [2024-11-10 18:51:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:10,331 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2024-11-10 18:51:10,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-10 18:51:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2024-11-10 18:51:10,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 18:51:10,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:10,332 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:10,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:51:10,333 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:10,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:10,333 INFO L85 PathProgramCache]: Analyzing trace with hash -561453607, now seen corresponding path program 1 times [2024-11-10 18:51:10,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:10,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524471957] [2024-11-10 18:51:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:10,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:51:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524471957] [2024-11-10 18:51:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524471957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:10,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:10,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:10,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522340622] [2024-11-10 18:51:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:10,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:10,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:51:10,484 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10 18:51:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:10,550 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2024-11-10 18:51:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:10,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2024-11-10 18:51:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:10,554 INFO L225 Difference]: With dead ends: 77 [2024-11-10 18:51:10,555 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 18:51:10,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-10 18:51:10,556 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:10,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 248 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 18:51:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-10 18:51:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 69 states have internal predecessors, (77), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:51:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-10 18:51:10,566 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 22 [2024-11-10 18:51:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:10,566 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-10 18:51:10,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-10 18:51:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-10 18:51:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 18:51:10,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:10,570 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:10,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:51:10,570 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:10,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:10,571 INFO L85 PathProgramCache]: Analyzing trace with hash 309702744, now seen corresponding path program 1 times [2024-11-10 18:51:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454983396] [2024-11-10 18:51:10,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:10,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 18:51:10,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:10,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454983396] [2024-11-10 18:51:10,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454983396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:10,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:10,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:51:10,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508477056] [2024-11-10 18:51:10,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:10,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:51:10,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:10,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:51:10,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:51:10,717 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 18:51:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:10,769 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2024-11-10 18:51:10,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:51:10,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 28 [2024-11-10 18:51:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:10,770 INFO L225 Difference]: With dead ends: 75 [2024-11-10 18:51:10,770 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 18:51:10,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10 18:51:10,771 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:10,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 120 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 18:51:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 18:51:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 63 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:51:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-10 18:51:10,776 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 28 [2024-11-10 18:51:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:10,777 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-10 18:51:10,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-10 18:51:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-11-10 18:51:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-10 18:51:10,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:10,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:51:10,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1955074108, now seen corresponding path program 1 times [2024-11-10 18:51:10,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122981027] [2024-11-10 18:51:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:51:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122981027] [2024-11-10 18:51:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122981027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198577223] [2024-11-10 18:51:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:10,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:51:10,860 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:10,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:10,911 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-10 18:51:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:10,911 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-10 18:51:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:10,912 INFO L225 Difference]: With dead ends: 69 [2024-11-10 18:51:10,912 INFO L226 Difference]: Without dead ends: 68 [2024-11-10 18:51:10,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10 18:51:10,913 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:10,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 214 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:10,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-10 18:51:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-10 18:51:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 62 states have internal predecessors, (70), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-10 18:51:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-11-10 18:51:10,918 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 35 [2024-11-10 18:51:10,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:10,918 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-11-10 18:51:10,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:10,918 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-11-10 18:51:10,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 18:51:10,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:10,919 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:51:10,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 477755268, now seen corresponding path program 1 times [2024-11-10 18:51:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:10,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045830793] [2024-11-10 18:51:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-10 18:51:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:51:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045830793] [2024-11-10 18:51:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045830793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:11,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216041884] [2024-11-10 18:51:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:11,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:11,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:11,043 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-10 18:51:11,050 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-10 18:51:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:51:11,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 18:51:11,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:51:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216041884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:11,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:51:11,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-10 18:51:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789530449] [2024-11-10 18:51:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:11,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:11,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:11,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:11,291 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:11,315 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2024-11-10 18:51:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:11,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-10 18:51:11,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:11,317 INFO L225 Difference]: With dead ends: 117 [2024-11-10 18:51:11,317 INFO L226 Difference]: Without dead ends: 61 [2024-11-10 18:51:11,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:11,319 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:11,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 231 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-10 18:51:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-10 18:51:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 56 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:11,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2024-11-10 18:51:11,328 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 36 [2024-11-10 18:51:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:11,329 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2024-11-10 18:51:11,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2024-11-10 18:51:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 18:51:11,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:11,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:11,350 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-10 18:51:11,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:11,531 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2114858987, now seen corresponding path program 1 times [2024-11-10 18:51:11,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:11,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198912964] [2024-11-10 18:51:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:11,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:11,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198912964] [2024-11-10 18:51:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198912964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:11,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:51:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910530760] [2024-11-10 18:51:11,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:51:11,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:11,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:51:11,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:51:11,671 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:11,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:11,722 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2024-11-10 18:51:11,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:51:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-10 18:51:11,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:11,723 INFO L225 Difference]: With dead ends: 61 [2024-11-10 18:51:11,723 INFO L226 Difference]: Without dead ends: 60 [2024-11-10 18:51:11,724 INFO L431 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-10 18:51:11,724 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:11,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 161 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:11,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-10 18:51:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-10 18:51:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 55 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:11,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2024-11-10 18:51:11,731 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 40 [2024-11-10 18:51:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:11,734 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2024-11-10 18:51:11,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2024-11-10 18:51:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 18:51:11,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:11,735 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:11,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:51:11,735 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:11,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:11,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1136119200, now seen corresponding path program 1 times [2024-11-10 18:51:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:11,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025703917] [2024-11-10 18:51:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-10 18:51:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025703917] [2024-11-10 18:51:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025703917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964580940] [2024-11-10 18:51:11,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:11,997 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-10 18:51:12,001 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-10 18:51:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:51:12,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:12,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:51:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964580940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:12,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:51:12,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-11-10 18:51:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768522099] [2024-11-10 18:51:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:12,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:12,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:12,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:51:12,387 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:12,426 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2024-11-10 18:51:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2024-11-10 18:51:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:12,427 INFO L225 Difference]: With dead ends: 60 [2024-11-10 18:51:12,428 INFO L226 Difference]: Without dead ends: 59 [2024-11-10 18:51:12,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:51:12,429 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 53 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:12,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-10 18:51:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-10 18:51:12,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 54 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 66 transitions. [2024-11-10 18:51:12,438 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 66 transitions. Word has length 41 [2024-11-10 18:51:12,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:12,438 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 66 transitions. [2024-11-10 18:51:12,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2024-11-10 18:51:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 18:51:12,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:12,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:12,453 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-10 18:51:12,644 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-10 18:51:12,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:12,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:12,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1719973437, now seen corresponding path program 1 times [2024-11-10 18:51:12,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:12,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873330807] [2024-11-10 18:51:12,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:12,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873330807] [2024-11-10 18:51:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873330807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:12,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:12,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:12,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679507623] [2024-11-10 18:51:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:12,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:51:12,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:51:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:51:12,770 INFO L87 Difference]: Start difference. First operand 59 states and 66 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:12,814 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2024-11-10 18:51:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:51:12,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-10 18:51:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:12,816 INFO L225 Difference]: With dead ends: 86 [2024-11-10 18:51:12,816 INFO L226 Difference]: Without dead ends: 62 [2024-11-10 18:51:12,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10 18:51:12,816 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:12,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:12,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-10 18:51:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-10 18:51:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 57 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:12,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2024-11-10 18:51:12,821 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 44 [2024-11-10 18:51:12,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:12,821 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2024-11-10 18:51:12,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:12,821 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2024-11-10 18:51:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-10 18:51:12,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:12,822 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:12,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:51:12,823 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1323209888, now seen corresponding path program 1 times [2024-11-10 18:51:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:12,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379245819] [2024-11-10 18:51:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379245819] [2024-11-10 18:51:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379245819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:51:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596979916] [2024-11-10 18:51:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:12,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:12,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:51:12,942 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:12,989 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2024-11-10 18:51:12,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2024-11-10 18:51:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:12,990 INFO L225 Difference]: With dead ends: 69 [2024-11-10 18:51:12,991 INFO L226 Difference]: Without dead ends: 67 [2024-11-10 18:51:12,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-10 18:51:12,991 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:12,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 211 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-10 18:51:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-10 18:51:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 61 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:12,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2024-11-10 18:51:12,995 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 46 [2024-11-10 18:51:12,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:12,995 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2024-11-10 18:51:12,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:12,995 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2024-11-10 18:51:12,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 18:51:12,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:12,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:12,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:51:12,996 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -780070792, now seen corresponding path program 1 times [2024-11-10 18:51:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:12,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188413308] [2024-11-10 18:51:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 18:51:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:13,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188413308] [2024-11-10 18:51:13,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188413308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:13,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:13,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:51:13,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148049292] [2024-11-10 18:51:13,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:13,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:51:13,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:13,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:51:13,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:51:13,138 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:13,190 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2024-11-10 18:51:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:51:13,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2024-11-10 18:51:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:13,191 INFO L225 Difference]: With dead ends: 96 [2024-11-10 18:51:13,191 INFO L226 Difference]: Without dead ends: 65 [2024-11-10 18:51:13,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-10 18:51:13,192 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:13,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 161 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-10 18:51:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-10 18:51:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 60 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2024-11-10 18:51:13,195 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 52 [2024-11-10 18:51:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:13,195 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2024-11-10 18:51:13,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2024-11-10 18:51:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 18:51:13,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:13,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:51:13,196 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:13,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:13,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1924593330, now seen corresponding path program 1 times [2024-11-10 18:51:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646933042] [2024-11-10 18:51:13,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:13,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:13,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646933042] [2024-11-10 18:51:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646933042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:13,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:51:13,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774743478] [2024-11-10 18:51:13,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:13,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:51:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:51:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:13,331 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:13,405 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2024-11-10 18:51:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:51:13,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-10 18:51:13,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:13,406 INFO L225 Difference]: With dead ends: 77 [2024-11-10 18:51:13,406 INFO L226 Difference]: Without dead ends: 76 [2024-11-10 18:51:13,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10 18:51:13,407 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:13,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 288 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-10 18:51:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-11-10 18:51:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.2) internal successors, (72), 65 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-10 18:51:13,410 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 55 [2024-11-10 18:51:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:13,410 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-10 18:51:13,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-10 18:51:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-10 18:51:13,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:13,411 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:13,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:51:13,412 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1924550630, now seen corresponding path program 1 times [2024-11-10 18:51:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:13,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353629416] [2024-11-10 18:51:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353629416] [2024-11-10 18:51:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353629416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421466254] [2024-11-10 18:51:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:13,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:13,529 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-10 18:51:13,534 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-10 18:51:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:13,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:51:13,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:13,750 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:13,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:51:13,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421466254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:13,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:51:13,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-10 18:51:13,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412453837] [2024-11-10 18:51:13,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:13,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:51:13,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:13,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:51:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:13,752 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:13,775 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-10 18:51:13,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:51:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2024-11-10 18:51:13,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:13,776 INFO L225 Difference]: With dead ends: 70 [2024-11-10 18:51:13,776 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 18:51:13,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:13,777 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:13,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:13,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 18:51:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 18:51:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 64 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:13,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2024-11-10 18:51:13,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 55 [2024-11-10 18:51:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:13,780 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2024-11-10 18:51:13,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2024-11-10 18:51:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 18:51:13,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:13,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:13,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:51:13,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:13,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 467148926, now seen corresponding path program 1 times [2024-11-10 18:51:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950532194] [2024-11-10 18:51:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:14,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950532194] [2024-11-10 18:51:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950532194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:14,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:51:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738250022] [2024-11-10 18:51:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:51:14,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:51:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:51:14,097 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:14,174 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2024-11-10 18:51:14,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:51:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-10 18:51:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:14,175 INFO L225 Difference]: With dead ends: 74 [2024-11-10 18:51:14,175 INFO L226 Difference]: Without dead ends: 73 [2024-11-10 18:51:14,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10 18:51:14,176 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:14,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 241 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-10 18:51:14,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-10 18:51:14,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.180327868852459) internal successors, (72), 65 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:14,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-10 18:51:14,179 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 56 [2024-11-10 18:51:14,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:14,179 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-10 18:51:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:14,180 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-10 18:51:14,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-10 18:51:14,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:14,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:14,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:51:14,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:14,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash 468472639, now seen corresponding path program 1 times [2024-11-10 18:51:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634658274] [2024-11-10 18:51:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634658274] [2024-11-10 18:51:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634658274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574513724] [2024-11-10 18:51:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:14,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:14,297 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-10 18:51:14,301 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-10 18:51:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:14,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:51:14,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:14,540 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574513724] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:14,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2024-11-10 18:51:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381208446] [2024-11-10 18:51:14,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 18:51:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:14,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 18:51:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:51:14,600 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:14,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:14,673 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-10 18:51:14,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:51:14,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2024-11-10 18:51:14,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:14,674 INFO L225 Difference]: With dead ends: 91 [2024-11-10 18:51:14,674 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 18:51:14,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:51:14,675 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:14,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 309 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 18:51:14,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-10 18:51:14,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2024-11-10 18:51:14,679 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 56 [2024-11-10 18:51:14,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:14,679 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2024-11-10 18:51:14,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:14,680 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2024-11-10 18:51:14,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-10 18:51:14,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:14,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:14,694 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-10 18:51:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 18:51:14,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:14,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:14,885 INFO L85 PathProgramCache]: Analyzing trace with hash 968676438, now seen corresponding path program 1 times [2024-11-10 18:51:14,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:14,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587949099] [2024-11-10 18:51:14,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:14,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,029 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:15,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:15,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587949099] [2024-11-10 18:51:15,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587949099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:15,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:15,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:51:15,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925488365] [2024-11-10 18:51:15,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:15,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:51:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:15,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:51:15,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:15,031 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:15,122 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-11-10 18:51:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:51:15,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60 [2024-11-10 18:51:15,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:15,123 INFO L225 Difference]: With dead ends: 94 [2024-11-10 18:51:15,123 INFO L226 Difference]: Without dead ends: 93 [2024-11-10 18:51:15,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:15,124 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 5 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:15,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:15,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-10 18:51:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-10 18:51:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 88 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-10 18:51:15,127 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 60 [2024-11-10 18:51:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:15,127 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-10 18:51:15,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-10 18:51:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 18:51:15,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:15,128 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2024-11-10 18:51:15,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 18:51:15,128 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -35801494, now seen corresponding path program 1 times [2024-11-10 18:51:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664374574] [2024-11-10 18:51:15,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:15,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:15,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:15,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664374574] [2024-11-10 18:51:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664374574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:15,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:51:15,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 18:51:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050488231] [2024-11-10 18:51:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:15,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 18:51:15,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:15,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 18:51:15,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:15,289 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:15,374 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-11-10 18:51:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:51:15,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2024-11-10 18:51:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:15,375 INFO L225 Difference]: With dead ends: 99 [2024-11-10 18:51:15,375 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 18:51:15,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-10 18:51:15,375 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:15,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 317 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 18:51:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-10 18:51:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-11-10 18:51:15,379 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 61 [2024-11-10 18:51:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:15,379 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-11-10 18:51:15,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-11-10 18:51:15,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-10 18:51:15,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:15,380 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:15,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:51:15,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:15,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:15,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2035457614, now seen corresponding path program 1 times [2024-11-10 18:51:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928179690] [2024-11-10 18:51:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928179690] [2024-11-10 18:51:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928179690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:15,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817982204] [2024-11-10 18:51:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:15,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:15,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:15,512 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-10 18:51:15,513 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-10 18:51:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:15,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:51:15,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:15,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:51:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817982204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:15,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:51:15,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2024-11-10 18:51:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384188118] [2024-11-10 18:51:15,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:15,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:51:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:15,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:51:15,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:51:15,767 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:15,824 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-11-10 18:51:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:51:15,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 61 [2024-11-10 18:51:15,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:15,825 INFO L225 Difference]: With dead ends: 99 [2024-11-10 18:51:15,825 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 18:51:15,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:51:15,826 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:15,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 324 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 18:51:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2024-11-10 18:51:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.1477272727272727) internal successors, (101), 91 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2024-11-10 18:51:15,829 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 61 [2024-11-10 18:51:15,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:15,830 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2024-11-10 18:51:15,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:15,830 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2024-11-10 18:51:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-10 18:51:15,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:15,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:15,846 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-10 18:51:16,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:16,035 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:16,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:16,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1325323418, now seen corresponding path program 1 times [2024-11-10 18:51:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071564280] [2024-11-10 18:51:16,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:16,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:16,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:16,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071564280] [2024-11-10 18:51:16,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071564280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:16,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652172639] [2024-11-10 18:51:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:16,200 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-10 18:51:16,202 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-10 18:51:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:16,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:51:16,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:16,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:16,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652172639] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:16,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:16,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 16 [2024-11-10 18:51:16,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940577903] [2024-11-10 18:51:16,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:16,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 18:51:16,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:16,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 18:51:16,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:51:16,562 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:16,659 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2024-11-10 18:51:16,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 18:51:16,660 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2024-11-10 18:51:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:16,661 INFO L225 Difference]: With dead ends: 114 [2024-11-10 18:51:16,661 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 18:51:16,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-10 18:51:16,662 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:16,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 382 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 18:51:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-10 18:51:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 94 states have (on average 1.148936170212766) internal successors, (108), 97 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2024-11-10 18:51:16,666 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 62 [2024-11-10 18:51:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2024-11-10 18:51:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2024-11-10 18:51:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 18:51:16,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:16,667 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:16,681 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-10 18:51:16,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:16,869 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1408506482, now seen corresponding path program 1 times [2024-11-10 18:51:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047347120] [2024-11-10 18:51:16,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:16,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,019 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:17,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047347120] [2024-11-10 18:51:17,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047347120] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:17,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997928250] [2024-11-10 18:51:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:17,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:17,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:17,021 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-10 18:51:17,023 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-10 18:51:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:51:17,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:17,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:51:17,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997928250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:51:17,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 18:51:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 12 [2024-11-10 18:51:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312834167] [2024-11-10 18:51:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:17,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 18:51:17,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 18:51:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:51:17,319 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:17,391 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2024-11-10 18:51:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 18:51:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2024-11-10 18:51:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:17,392 INFO L225 Difference]: With dead ends: 102 [2024-11-10 18:51:17,392 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 18:51:17,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-10 18:51:17,393 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:17,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 365 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 18:51:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-10 18:51:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2024-11-10 18:51:17,396 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 66 [2024-11-10 18:51:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:17,396 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2024-11-10 18:51:17,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2024-11-10 18:51:17,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 18:51:17,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:17,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:17,411 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-10 18:51:17,601 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-10 18:51:17,602 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:17,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:17,602 INFO L85 PathProgramCache]: Analyzing trace with hash -138089242, now seen corresponding path program 1 times [2024-11-10 18:51:17,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:17,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091967036] [2024-11-10 18:51:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:17,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:17,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:17,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091967036] [2024-11-10 18:51:17,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091967036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:17,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377714257] [2024-11-10 18:51:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:17,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:17,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:17,877 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-10 18:51:17,878 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-10 18:51:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:18,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:51:18,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:18,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:18,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377714257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:18,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:18,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2024-11-10 18:51:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617237851] [2024-11-10 18:51:18,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:18,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 18:51:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 18:51:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-10 18:51:18,260 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:18,371 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2024-11-10 18:51:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 18:51:18,372 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 67 [2024-11-10 18:51:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:18,372 INFO L225 Difference]: With dead ends: 121 [2024-11-10 18:51:18,372 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 18:51:18,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2024-11-10 18:51:18,373 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:18,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 453 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:18,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 18:51:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2024-11-10 18:51:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 111 states have (on average 1.1081081081081081) internal successors, (123), 113 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2024-11-10 18:51:18,377 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 67 [2024-11-10 18:51:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:18,377 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2024-11-10 18:51:18,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:18,377 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2024-11-10 18:51:18,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 18:51:18,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:18,377 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 18:51:18,391 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-10 18:51:18,578 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,SelfDestructingSolverStorable21 [2024-11-10 18:51:18,578 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:18,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:18,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1667110450, now seen corresponding path program 1 times [2024-11-10 18:51:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:18,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898475755] [2024-11-10 18:51:18,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:18,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898475755] [2024-11-10 18:51:18,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898475755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:18,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536621863] [2024-11-10 18:51:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:18,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:18,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:18,749 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-10 18:51:18,753 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-10 18:51:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:19,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 18:51:19,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:19,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:19,193 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:19,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536621863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:19,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:19,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 24 [2024-11-10 18:51:19,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588819965] [2024-11-10 18:51:19,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:19,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 18:51:19,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:19,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 18:51:19,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:51:19,195 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:19,365 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2024-11-10 18:51:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 18:51:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-10 18:51:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:19,367 INFO L225 Difference]: With dead ends: 169 [2024-11-10 18:51:19,367 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 18:51:19,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2024-11-10 18:51:19,368 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 22 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:19,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 549 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:51:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 18:51:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2024-11-10 18:51:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.1129032258064515) internal successors, (138), 126 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:19,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2024-11-10 18:51:19,373 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 73 [2024-11-10 18:51:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:19,374 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2024-11-10 18:51:19,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 24 states have internal predecessors, (92), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2024-11-10 18:51:19,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 18:51:19,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:19,374 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:51:19,394 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-10 18:51:19,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:19,579 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:19,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1459823162, now seen corresponding path program 1 times [2024-11-10 18:51:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:19,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3753171] [2024-11-10 18:51:19,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:19,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:19,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:19,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3753171] [2024-11-10 18:51:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3753171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819696913] [2024-11-10 18:51:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:19,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:19,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:19,808 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-10 18:51:19,819 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-10 18:51:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:20,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 18:51:20,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:20,169 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:20,169 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:20,446 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:20,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819696913] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:20,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:20,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 28 [2024-11-10 18:51:20,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059538538] [2024-11-10 18:51:20,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:20,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 18:51:20,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:20,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 18:51:20,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-10 18:51:20,448 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:20,673 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2024-11-10 18:51:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 18:51:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 79 [2024-11-10 18:51:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:20,674 INFO L225 Difference]: With dead ends: 192 [2024-11-10 18:51:20,674 INFO L226 Difference]: Without dead ends: 191 [2024-11-10 18:51:20,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-10 18:51:20,675 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:20,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 457 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:51:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-10 18:51:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 143. [2024-11-10 18:51:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 136 states have (on average 1.1029411764705883) internal successors, (150), 138 states have internal predecessors, (150), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2024-11-10 18:51:20,679 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 79 [2024-11-10 18:51:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:20,680 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2024-11-10 18:51:20,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.7142857142857144) internal successors, (104), 28 states have internal predecessors, (104), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2024-11-10 18:51:20,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 18:51:20,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:20,681 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 3, 3, 3, 3, 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] [2024-11-10 18:51:20,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:51:20,881 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,SelfDestructingSolverStorable23 [2024-11-10 18:51:20,885 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:20,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:20,886 INFO L85 PathProgramCache]: Analyzing trace with hash -415881781, now seen corresponding path program 2 times [2024-11-10 18:51:20,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:20,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877321549] [2024-11-10 18:51:20,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:20,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:21,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:21,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:21,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:21,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877321549] [2024-11-10 18:51:21,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877321549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:21,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931599875] [2024-11-10 18:51:21,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:21,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:21,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:21,219 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-10 18:51:21,221 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-10 18:51:21,572 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:21,572 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:21,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 18:51:21,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:21,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:21,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931599875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:21,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:21,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 32 [2024-11-10 18:51:21,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067914693] [2024-11-10 18:51:21,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:21,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-10 18:51:21,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:21,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-10 18:51:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 18:51:21,891 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 33 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:22,027 INFO L93 Difference]: Finished difference Result 210 states and 237 transitions. [2024-11-10 18:51:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-10 18:51:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 86 [2024-11-10 18:51:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:22,028 INFO L225 Difference]: With dead ends: 210 [2024-11-10 18:51:22,028 INFO L226 Difference]: Without dead ends: 209 [2024-11-10 18:51:22,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=783, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 18:51:22,029 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:22,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 364 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-10 18:51:22,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 189. [2024-11-10 18:51:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 182 states have (on average 1.1153846153846154) internal successors, (203), 184 states have internal predecessors, (203), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2024-11-10 18:51:22,035 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 86 [2024-11-10 18:51:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:22,035 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2024-11-10 18:51:22,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.6875) internal successors, (118), 32 states have internal predecessors, (118), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2024-11-10 18:51:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 18:51:22,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:22,036 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 18:51:22,051 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-10 18:51:22,240 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,SelfDestructingSolverStorable24 [2024-11-10 18:51:22,241 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:22,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:22,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1200664742, now seen corresponding path program 2 times [2024-11-10 18:51:22,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:22,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086770156] [2024-11-10 18:51:22,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:22,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:22,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:22,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086770156] [2024-11-10 18:51:22,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086770156] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:22,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987299847] [2024-11-10 18:51:22,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:22,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:22,541 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-10 18:51:22,542 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-10 18:51:22,892 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:22,892 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:22,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:51:22,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:23,030 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:23,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:23,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987299847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:23,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:23,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 36 [2024-11-10 18:51:23,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632230284] [2024-11-10 18:51:23,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:23,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-10 18:51:23,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:23,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-10 18:51:23,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 18:51:23,298 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 36 states have internal predecessors, (128), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:23,450 INFO L93 Difference]: Finished difference Result 265 states and 289 transitions. [2024-11-10 18:51:23,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 18:51:23,450 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 36 states have internal predecessors, (128), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 91 [2024-11-10 18:51:23,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:23,453 INFO L225 Difference]: With dead ends: 265 [2024-11-10 18:51:23,453 INFO L226 Difference]: Without dead ends: 264 [2024-11-10 18:51:23,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 18:51:23,456 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 24 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:23,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 553 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:23,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-10 18:51:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 196. [2024-11-10 18:51:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 189 states have (on average 1.1111111111111112) internal successors, (210), 191 states have internal predecessors, (210), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2024-11-10 18:51:23,471 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 91 [2024-11-10 18:51:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:23,472 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2024-11-10 18:51:23,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.5555555555555554) internal successors, (128), 36 states have internal predecessors, (128), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2024-11-10 18:51:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 18:51:23,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:23,472 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 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] [2024-11-10 18:51:23,487 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-10 18:51:23,673 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,SelfDestructingSolverStorable25 [2024-11-10 18:51:23,673 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1978954202, now seen corresponding path program 2 times [2024-11-10 18:51:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981879743] [2024-11-10 18:51:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:23,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:24,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:24,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:24,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981879743] [2024-11-10 18:51:24,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981879743] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:24,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968059658] [2024-11-10 18:51:24,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:24,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:24,007 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-10 18:51:24,008 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-10 18:51:24,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:24,323 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:24,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-10 18:51:24,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:24,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:24,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968059658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:24,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:24,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 36 [2024-11-10 18:51:24,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884554155] [2024-11-10 18:51:24,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:24,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-10 18:51:24,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:24,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-10 18:51:24,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 18:51:24,668 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand has 37 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:24,861 INFO L93 Difference]: Finished difference Result 234 states and 256 transitions. [2024-11-10 18:51:24,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-10 18:51:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 92 [2024-11-10 18:51:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:24,863 INFO L225 Difference]: With dead ends: 234 [2024-11-10 18:51:24,863 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 18:51:24,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=313, Invalid=1019, Unknown=0, NotChecked=0, Total=1332 [2024-11-10 18:51:24,866 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 45 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:24,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 534 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:51:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 18:51:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 202. [2024-11-10 18:51:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 195 states have (on average 1.1128205128205129) internal successors, (217), 197 states have internal predecessors, (217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:24,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2024-11-10 18:51:24,883 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 92 [2024-11-10 18:51:24,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:24,884 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2024-11-10 18:51:24,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.611111111111111) internal successors, (130), 36 states have internal predecessors, (130), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:24,884 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2024-11-10 18:51:24,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 18:51:24,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:24,884 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 3, 3, 3, 3, 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] [2024-11-10 18:51:24,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-10 18:51:25,085 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,SelfDestructingSolverStorable26 [2024-11-10 18:51:25,085 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1770745406, now seen corresponding path program 2 times [2024-11-10 18:51:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416524583] [2024-11-10 18:51:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:25,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:25,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416524583] [2024-11-10 18:51:25,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416524583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:25,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149066515] [2024-11-10 18:51:25,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:25,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:25,424 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-10 18:51:25,425 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-10 18:51:25,788 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:25,789 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:25,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 18:51:25,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:25,935 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:25,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:26,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149066515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:26,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:26,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 40 [2024-11-10 18:51:26,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793779344] [2024-11-10 18:51:26,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:26,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-10 18:51:26,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:26,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-10 18:51:26,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 18:51:26,270 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 41 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:26,464 INFO L93 Difference]: Finished difference Result 253 states and 275 transitions. [2024-11-10 18:51:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 18:51:26,465 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 97 [2024-11-10 18:51:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:26,466 INFO L225 Difference]: With dead ends: 253 [2024-11-10 18:51:26,466 INFO L226 Difference]: Without dead ends: 252 [2024-11-10 18:51:26,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=357, Invalid=1283, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 18:51:26,467 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 62 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:26,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 603 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 18:51:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-10 18:51:26,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 208. [2024-11-10 18:51:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 201 states have (on average 1.109452736318408) internal successors, (223), 203 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 229 transitions. [2024-11-10 18:51:26,474 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 229 transitions. Word has length 97 [2024-11-10 18:51:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:26,474 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 229 transitions. [2024-11-10 18:51:26,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 229 transitions. [2024-11-10 18:51:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-10 18:51:26,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:26,475 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-10 18:51:26,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-10 18:51:26,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:26,680 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:26,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:26,680 INFO L85 PathProgramCache]: Analyzing trace with hash -137370234, now seen corresponding path program 3 times [2024-11-10 18:51:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904110002] [2024-11-10 18:51:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:26,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904110002] [2024-11-10 18:51:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904110002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220558978] [2024-11-10 18:51:27,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:51:27,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:27,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:27,037 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:51:27,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 18:51:28,269 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 18:51:28,269 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:28,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:51:28,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:51:28,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-10 18:51:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220558978] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 18:51:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [22, 8] total 34 [2024-11-10 18:51:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087368897] [2024-11-10 18:51:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:51:28,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 18:51:28,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 18:51:28,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 18:51:28,626 INFO L87 Difference]: Start difference. First operand 208 states and 229 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:28,745 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2024-11-10 18:51:28,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:51:28,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 103 [2024-11-10 18:51:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:28,746 INFO L225 Difference]: With dead ends: 266 [2024-11-10 18:51:28,747 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 18:51:28,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=1260, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 18:51:28,747 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 43 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:28,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 271 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 18:51:28,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 18:51:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-10 18:51:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2024-11-10 18:51:28,755 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 103 [2024-11-10 18:51:28,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:28,755 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2024-11-10 18:51:28,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-10 18:51:28,755 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2024-11-10 18:51:28,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 18:51:28,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:28,756 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 3, 3, 3, 3, 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] [2024-11-10 18:51:28,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-10 18:51:28,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 18:51:28,961 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1806630474, now seen corresponding path program 2 times [2024-11-10 18:51:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:28,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468127287] [2024-11-10 18:51:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:28,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:29,335 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:29,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468127287] [2024-11-10 18:51:29,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468127287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:29,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267822787] [2024-11-10 18:51:29,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:51:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:29,337 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:51:29,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 18:51:29,713 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 18:51:29,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:29,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 18:51:29,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:29,825 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:29,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267822787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 18:51:30,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 18:51:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 48 [2024-11-10 18:51:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062981124] [2024-11-10 18:51:30,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 18:51:30,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-10 18:51:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:51:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-10 18:51:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 18:51:30,311 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 49 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:30,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 18:51:30,471 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2024-11-10 18:51:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-10 18:51:30,471 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 109 [2024-11-10 18:51:30,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 18:51:30,472 INFO L225 Difference]: With dead ends: 163 [2024-11-10 18:51:30,472 INFO L226 Difference]: Without dead ends: 162 [2024-11-10 18:51:30,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=505, Invalid=1847, Unknown=0, NotChecked=0, Total=2352 [2024-11-10 18:51:30,473 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 5 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 18:51:30,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 491 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 18:51:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-10 18:51:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-10 18:51:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 157 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 18:51:30,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 168 transitions. [2024-11-10 18:51:30,483 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 168 transitions. Word has length 109 [2024-11-10 18:51:30,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 18:51:30,484 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 168 transitions. [2024-11-10 18:51:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.4166666666666665) internal successors, (164), 48 states have internal predecessors, (164), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 18:51:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 168 transitions. [2024-11-10 18:51:30,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-10 18:51:30,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 18:51:30,485 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 3, 3, 3, 3, 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] [2024-11-10 18:51:30,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-10 18:51:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:30,690 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 11 more)] === [2024-11-10 18:51:30,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:51:30,691 INFO L85 PathProgramCache]: Analyzing trace with hash -621410782, now seen corresponding path program 3 times [2024-11-10 18:51:30,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:51:30,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996938841] [2024-11-10 18:51:30,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:51:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:51:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 18:51:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:31,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 18:51:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 18:51:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:51:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-10 18:51:31,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:51:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996938841] [2024-11-10 18:51:31,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996938841] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 18:51:31,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927721290] [2024-11-10 18:51:31,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 18:51:31,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 18:51:31,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:51:31,844 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 18:51:31,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 18:51:34,366 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-10 18:51:34,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:51:34,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 157 conjuncts are in the unsatisfiable core [2024-11-10 18:51:34,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:51:34,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-10 18:51:34,677 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 18:51:34,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 18:51:34,731 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-10 18:51:34,737 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-10 18:51:34,799 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 18:51:34,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 18:51:34,993 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 18:51:34,993 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 112 treesize of output 58 [2024-11-10 18:51:35,001 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 55 treesize of output 22 [2024-11-10 18:51:35,390 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-10 18:51:35,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 31 [2024-11-10 18:51:35,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-10 18:51:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-11-10 18:51:35,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:51:35,755 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-10 18:51:35,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 55 [2024-11-10 18:51:35,775 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-10 18:51:35,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-10 18:51:35,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-10 18:51:36,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 63 [2024-11-10 18:51:36,551 INFO L349 Elim1Store]: treesize reduction 130, result has 17.2 percent of original size [2024-11-10 18:51:36,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 97 [2024-11-10 18:51:37,401 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-10 18:51:37,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 65 [2024-11-10 18:51:37,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-10 18:51:37,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-10 18:51:37,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 113 proven. 12 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2024-11-10 18:51:37,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 18:51:41,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4))) (let ((.cse10 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse6 (let ((.cse18 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)))) (store .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse18 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) .cse12 |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|)) (.cse8 (+ |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) (.cse5 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (forall ((v_ArrVal_5618 Int) (v_ArrVal_5614 Int)) (= (let ((.cse3 (let ((.cse9 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse12 v_ArrVal_5618) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse0 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_5614)))) (let ((.cse1 (select (select .cse0 .cse4) .cse5)) (.cse2 (select (select .cse3 .cse4) .cse5))) (select (select .cse0 (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2)))) .cse4)) (forall ((v_ArrVal_5618 Int) (v_ArrVal_5614 Int)) (= (let ((.cse13 (let ((.cse17 (store .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store .cse11 .cse12 v_ArrVal_5618) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|)))) (store .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse17 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (.cse14 (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse7 .cse8 v_ArrVal_5614)))) (let ((.cse15 (select (select .cse14 .cse4) .cse5)) (.cse16 (select (select .cse13 .cse4) .cse5))) (select (select .cse13 (select (select .cse14 .cse15) .cse16)) (select (select .cse13 .cse15) .cse16)))) .cse5)))))) is different from false