/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/loops/heavy-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:36:58,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:36:58,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:36:58,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:36:58,360 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:36:58,362 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:36:58,363 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:36:58,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:36:58,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:36:58,369 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:36:58,371 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:36:58,372 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:36:58,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:36:58,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:36:58,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:36:58,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:36:58,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:36:58,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:36:58,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:36:58,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:36:58,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:36:58,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:36:58,398 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:36:58,399 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:36:58,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:36:58,404 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:36:58,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:36:58,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:36:58,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:36:58,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:36:58,407 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:36:58,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:36:58,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:36:58,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:36:58,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:36:58,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:36:58,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:36:58,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:36:58,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:36:58,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:36:58,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:36:58,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 14:36:58,443 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:36:58,444 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:36:58,444 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:36:58,444 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:36:58,445 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:36:58,446 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:36:58,447 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:36:58,447 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:36:58,447 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:36:58,447 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:36:58,448 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:36:58,448 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:36:58,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:36:58,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:36:58,449 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:36:58,449 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:36:58,449 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:36:58,450 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:36:58,450 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:36:58,450 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:36:58,450 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:36:58,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:36:58,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:36:58,451 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:36:58,451 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:36:58,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:36:58,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:36:58,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:36:58,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:36:58,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:36:58,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:36:58,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:36:58,453 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:36:58,454 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-10-16 14:36:58,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:36:58,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:36:58,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:36:58,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:36:58,914 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:36:58,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/heavy-2.c [2022-10-16 14:36:59,007 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37bf00a08/0cbdc701c22a4e75b6aca4288987bed1/FLAGd0ca1104f [2022-10-16 14:36:59,667 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:36:59,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/heavy-2.c [2022-10-16 14:36:59,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37bf00a08/0cbdc701c22a4e75b6aca4288987bed1/FLAGd0ca1104f [2022-10-16 14:37:00,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37bf00a08/0cbdc701c22a4e75b6aca4288987bed1 [2022-10-16 14:37:00,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:37:00,073 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:37:00,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:37:00,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:37:00,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:37:00,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47892c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00, skipping insertion in model container [2022-10-16 14:37:00,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:37:00,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:37:00,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/heavy-2.c[600,613] [2022-10-16 14:37:00,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:37:00,426 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:37:00,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/heavy-2.c[600,613] [2022-10-16 14:37:00,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:37:00,605 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:37:00,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00 WrapperNode [2022-10-16 14:37:00,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:37:00,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:37:00,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:37:00,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:37:00,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,625 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,648 INFO L138 Inliner]: procedures = 12, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2022-10-16 14:37:00,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:37:00,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:37:00,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:37:00,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:37:00,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:37:00,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:37:00,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:37:00,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:37:00,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (1/1) ... [2022-10-16 14:37:00,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:37:00,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:37:00,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-16 14:37:00,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-16 14:37:00,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:37:00,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:37:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:37:00,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:37:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:37:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:37:00,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-10-16 14:37:00,872 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:37:00,874 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:37:01,060 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:37:01,067 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:37:01,067 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-10-16 14:37:01,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:37:01 BoogieIcfgContainer [2022-10-16 14:37:01,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:37:01,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:37:01,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:37:01,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:37:01,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:37:00" (1/3) ... [2022-10-16 14:37:01,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57d348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:37:01, skipping insertion in model container [2022-10-16 14:37:01,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:37:00" (2/3) ... [2022-10-16 14:37:01,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d57d348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:37:01, skipping insertion in model container [2022-10-16 14:37:01,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:37:01" (3/3) ... [2022-10-16 14:37:01,082 INFO L112 eAbstractionObserver]: Analyzing ICFG heavy-2.c [2022-10-16 14:37:01,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:37:01,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-16 14:37:01,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:37:01,256 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@27bbfe1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:37:01,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-16 14:37:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-10-16 14:37:01,269 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:37:01,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-10-16 14:37:01,271 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:37:01,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:37:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 889666764, now seen corresponding path program 1 times [2022-10-16 14:37:01,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:37:01,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463159614] [2022-10-16 14:37:01,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:37:01,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:37:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:37:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:37:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:37:02,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463159614] [2022-10-16 14:37:02,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463159614] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:37:02,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:37:02,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:37:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770829346] [2022-10-16 14:37:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:37:02,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:37:02,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:37:02,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:37:02,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:37:02,637 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:02,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:37:02,770 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-10-16 14:37:02,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:37:02,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-10-16 14:37:02,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:37:02,783 INFO L225 Difference]: With dead ends: 45 [2022-10-16 14:37:02,784 INFO L226 Difference]: Without dead ends: 20 [2022-10-16 14:37:02,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:37:02,793 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:37:02,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 48 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:37:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-16 14:37:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-10-16 14:37:02,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-16 14:37:02,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 6 [2022-10-16 14:37:02,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:37:02,837 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-16 14:37:02,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-16 14:37:02,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-10-16 14:37:02,838 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:37:02,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:37:02,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:37:02,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:37:02,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:37:02,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1809865968, now seen corresponding path program 1 times [2022-10-16 14:37:02,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:37:02,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31480796] [2022-10-16 14:37:02,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:37:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:37:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:37:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:37:03,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:37:03,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31480796] [2022-10-16 14:37:03,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31480796] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:37:03,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:37:03,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:37:03,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121679914] [2022-10-16 14:37:03,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:37:03,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:37:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:37:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:37:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:37:03,378 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:37:03,451 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-10-16 14:37:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:37:03,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-10-16 14:37:03,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:37:03,453 INFO L225 Difference]: With dead ends: 20 [2022-10-16 14:37:03,453 INFO L226 Difference]: Without dead ends: 19 [2022-10-16 14:37:03,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:37:03,456 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:37:03,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:37:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-10-16 14:37:03,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-10-16 14:37:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-10-16 14:37:03,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 7 [2022-10-16 14:37:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:37:03,464 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-10-16 14:37:03,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:37:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-10-16 14:37:03,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-16 14:37:03,465 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:37:03,465 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:37:03,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:37:03,466 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:37:03,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:37:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1302319920, now seen corresponding path program 1 times [2022-10-16 14:37:03,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:37:03,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445506513] [2022-10-16 14:37:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:37:03,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:37:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:37:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:37:07,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:37:07,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445506513] [2022-10-16 14:37:07,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445506513] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:37:07,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100147283] [2022-10-16 14:37:07,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:37:07,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:37:07,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:37:07,099 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) [2022-10-16 14:37:07,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 14:37:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:37:07,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-16 14:37:07,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:37:07,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-10-16 14:37:09,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-10-16 14:37:10,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-10-16 14:37:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:37:10,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:37:14,779 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (let ((.cse10 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse5 (<= .cse17 2147483647))) (let ((.cse1 (+ .cse17 |c_~#array~0.offset| (- 4294967296))) (.cse7 (+ .cse17 |c_~#array~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#array~0.base|)) (.cse9 (not .cse5)) (.cse11 (<= .cse10 2147483647))) (and (or (let ((.cse3 (+ .cse10 |c_~#array~0.offset|))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse0 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse0 .cse1) (select .cse0 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse4 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse4 .cse1) (select .cse4 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (< (let ((.cse6 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse6 .cse7) (select .cse6 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse8 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse8 .cse7) (select .cse8 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse9))) (not .cse11)) (or (let ((.cse13 (+ .cse10 |c_~#array~0.offset| (- 4294967296)))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse12 (store .cse2 .cse13 v_ArrVal_16))) (+ (select .cse12 .cse1) (select .cse12 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse14 (store .cse2 .cse13 v_ArrVal_16))) (+ (select .cse14 .cse1) (select .cse14 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse15 (store .cse2 .cse13 v_ArrVal_16))) (+ (select .cse15 .cse7) (select .cse15 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse16 (store .cse2 .cse13 v_ArrVal_16))) (+ (select .cse16 .cse7) (select .cse16 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648)))))) .cse9))) .cse11))))) is different from false [2022-10-16 14:37:32,021 WARN L233 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:37:38,244 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:38:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-10-16 14:38:02,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100147283] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:38:02,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:38:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2022-10-16 14:38:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878740020] [2022-10-16 14:38:02,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:38:02,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-16 14:38:02,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:38:02,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-16 14:38:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=228, Unknown=11, NotChecked=32, Total=342 [2022-10-16 14:38:02,413 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:38:04,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (let ((.cse10 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse5 (<= .cse20 2147483647))) (let ((.cse12 ((as const (Array Int Int)) 0)) (.cse1 (+ .cse20 |c_~#array~0.offset| (- 4294967296))) (.cse7 (+ .cse20 |c_~#array~0.offset|)) (.cse2 (select |c_#memory_int| |c_~#array~0.base|)) (.cse9 (not .cse5)) (.cse11 (<= .cse10 2147483647))) (and (= |c_ULTIMATE.start_main_~k~0#1| 0) (or (let ((.cse3 (+ .cse10 |c_~#array~0.offset|))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse0 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse0 .cse1) (select .cse0 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse4 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse4 .cse1) (select .cse4 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (< (let ((.cse6 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse6 .cse7) (select .cse6 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse8 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse8 .cse7) (select .cse8 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse9))) (not .cse11)) (= |c_~#array~0.offset| 0) (= 1 (select .cse2 |c_~#array~0.offset|)) (exists ((v_ArrVal_14 Int)) (and (= .cse2 (store .cse12 |c_~#array~0.offset| v_ArrVal_14)) (<= v_ArrVal_14 1))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (let ((.cse13 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (or (not (= |c_ULTIMATE.start_main_~j~0#1| (* 4294967296 .cse13))) (= (select .cse2 (+ |c_ULTIMATE.start_main_~j~0#1| |c_~#array~0.offset| (* (- 4294967296) .cse13))) 1))) (let ((.cse14 (select .cse2 (+ (* (div |c_ULTIMATE.start_main_~k~0#1| 4294967296) (- 4294967296)) |c_~#array~0.offset| |c_ULTIMATE.start_main_~k~0#1|)))) (or (= .cse14 0) (= .cse14 1))) (= .cse12 (store .cse2 |c_~#array~0.offset| 0)) (= |c_ULTIMATE.start_main_~j~0#1| 0) (or (let ((.cse16 (+ .cse10 |c_~#array~0.offset| (- 4294967296)))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse15 (store .cse2 .cse16 v_ArrVal_16))) (+ (select .cse15 .cse1) (select .cse15 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse17 (store .cse2 .cse16 v_ArrVal_16))) (+ (select .cse17 .cse1) (select .cse17 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse18 (store .cse2 .cse16 v_ArrVal_16))) (+ (select .cse18 .cse7) (select .cse18 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse19 (store .cse2 .cse16 v_ArrVal_16))) (+ (select .cse19 .cse7) (select .cse19 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648)))))) .cse9))) .cse11))))) is different from false [2022-10-16 14:38:06,614 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse26 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (let ((.cse10 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse5 (<= .cse26 2147483647)) (.cse17 ((as const (Array Int Int)) 0)) (.cse2 (select |c_#memory_int| |c_~#array~0.base|))) (let ((.cse13 (= .cse17 (store .cse2 |c_~#array~0.offset| 0))) (.cse14 (not (= (select .cse2 (+ (* (div |c_ULTIMATE.start_main_~k~0#1| 4294967296) (- 4294967296)) |c_~#array~0.offset| |c_ULTIMATE.start_main_~k~0#1|)) 0))) (.cse16 (= |c_ULTIMATE.start_main_~j~0#1| (* 4294967296 (div |c_ULTIMATE.start_main_~j~0#1| 4294967296)))) (.cse18 (= 0 |c_ULTIMATE.start_main_#t~mem8#1|)) (.cse1 (+ .cse26 |c_~#array~0.offset| (- 4294967296))) (.cse7 (+ .cse26 |c_~#array~0.offset|)) (.cse9 (not .cse5)) (.cse11 (<= .cse10 2147483647)) (.cse20 (= |c_ULTIMATE.start_main_#t~mem8#1| 1)) (.cse12 (= |c_ULTIMATE.start_main_#t~mem7#1| 1)) (.cse19 (= |c_ULTIMATE.start_main_#t~mem7#1| 0))) (and (= |c_ULTIMATE.start_main_~k~0#1| 0) (or (let ((.cse3 (+ .cse10 |c_~#array~0.offset|))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse0 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse0 .cse1) (select .cse0 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse4 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse4 .cse1) (select .cse4 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (< (let ((.cse6 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse6 .cse7) (select .cse6 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse8 (store .cse2 .cse3 v_ArrVal_16))) (+ (select .cse8 .cse7) (select .cse8 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse9))) (not .cse11)) (or (let ((.cse15 (= |c_ULTIMATE.start_main_~i~0#1| (* (div |c_ULTIMATE.start_main_~i~0#1| 4294967296) 4294967296)))) (and (or (and .cse12 .cse13 .cse14) (not .cse15)) (or .cse15 (and (= 1 (select .cse2 |c_~#array~0.offset|)) .cse13)))) (not .cse16)) (= |c_~#array~0.offset| 0) (exists ((v_ArrVal_14 Int)) (and (= .cse2 (store .cse17 |c_~#array~0.offset| v_ArrVal_14)) (<= v_ArrVal_14 1))) (or (and .cse13 (or .cse14 .cse18) .cse19) .cse16) (= |c_ULTIMATE.start_main_~i~0#1| 0) (or .cse20 .cse18) (= |c_ULTIMATE.start_main_~j~0#1| 0) (or (let ((.cse22 (+ .cse10 |c_~#array~0.offset| (- 4294967296)))) (and (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse21 (store .cse2 .cse22 v_ArrVal_16))) (+ (select .cse21 .cse1) (select .cse21 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse23 (store .cse2 .cse22 v_ArrVal_16))) (+ (select .cse23 .cse1) (select .cse23 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648))) (< 127 v_ArrVal_16)))) .cse5) (or (and (forall ((v_ArrVal_16 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse24 (store .cse2 .cse22 v_ArrVal_16))) (+ (select .cse24 .cse7) (select .cse24 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_16))) (forall ((v_ArrVal_16 Int)) (or (< 127 v_ArrVal_16) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse25 (store .cse2 .cse22 v_ArrVal_16))) (+ (select .cse25 .cse7) (select .cse25 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648)))))) .cse9))) .cse11) (or (and .cse20 .cse12) .cse19))))) is different from false [2022-10-16 14:38:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:38:10,247 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-10-16 14:38:10,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-16 14:38:10,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-10-16 14:38:10,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:38:10,248 INFO L225 Difference]: With dead ends: 44 [2022-10-16 14:38:10,249 INFO L226 Difference]: Without dead ends: 27 [2022-10-16 14:38:10,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 61.3s TimeCoverageRelationStatistics Valid=128, Invalid=421, Unknown=15, NotChecked=138, Total=702 [2022-10-16 14:38:10,252 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:38:10,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-10-16 14:38:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-10-16 14:38:10,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-10-16 14:38:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:38:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-10-16 14:38:10,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2022-10-16 14:38:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:38:10,262 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-10-16 14:38:10,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:38:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-10-16 14:38:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-16 14:38:10,263 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:38:10,264 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:38:10,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-16 14:38:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:38:10,478 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:38:10,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:38:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1717211796, now seen corresponding path program 1 times [2022-10-16 14:38:10,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:38:10,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995243803] [2022-10-16 14:38:10,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:38:10,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:38:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:38:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:38:12,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:38:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995243803] [2022-10-16 14:38:12,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995243803] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:38:12,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384450645] [2022-10-16 14:38:12,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:38:12,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:38:12,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:38:12,324 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) [2022-10-16 14:38:12,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 14:38:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:38:12,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2022-10-16 14:38:12,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:38:12,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-10-16 14:38:12,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-10-16 14:38:13,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-10-16 14:38:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:38:13,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:38:57,827 WARN L233 SmtUtils]: Spent 28.15s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:39:10,864 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:39:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:39:49,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384450645] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:39:49,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:39:49,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 18 [2022-10-16 14:39:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903722065] [2022-10-16 14:39:49,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:39:49,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-16 14:39:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:39:49,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-16 14:39:49,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=272, Unknown=23, NotChecked=0, Total=380 [2022-10-16 14:39:49,257 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:43,384 WARN L233 SmtUtils]: Spent 28.16s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-10-16 14:40:48,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:40:48,765 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-10-16 14:40:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 14:40:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-10-16 14:40:48,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:40:48,767 INFO L225 Difference]: With dead ends: 43 [2022-10-16 14:40:48,767 INFO L226 Difference]: Without dead ends: 26 [2022-10-16 14:40:48,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 155.1s TimeCoverageRelationStatistics Valid=221, Invalid=611, Unknown=38, NotChecked=0, Total=870 [2022-10-16 14:40:48,772 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:40:48,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 50 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-10-16 14:40:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-16 14:40:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-10-16 14:40:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-10-16 14:40:48,781 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 11 [2022-10-16 14:40:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:40:48,781 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-10-16 14:40:48,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.736842105263158) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-10-16 14:40:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-10-16 14:40:48,782 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:40:48,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:40:48,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:40:48,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-10-16 14:40:48,997 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:40:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:40:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -974712744, now seen corresponding path program 1 times [2022-10-16 14:40:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:40:49,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160914530] [2022-10-16 14:40:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:40:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:40:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:40:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:40:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:40:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160914530] [2022-10-16 14:40:49,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160914530] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:40:49,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676919544] [2022-10-16 14:40:49,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:40:49,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:40:49,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:40:49,073 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) [2022-10-16 14:40:49,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:40:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:40:49,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-16 14:40:49,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:40:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:40:49,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:40:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:40:49,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676919544] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:40:49,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:40:49,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 11 [2022-10-16 14:40:49,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799170240] [2022-10-16 14:40:49,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:40:49,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-16 14:40:49,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:40:49,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-16 14:40:49,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:40:49,249 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:40:49,423 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2022-10-16 14:40:49,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-16 14:40:49,424 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-10-16 14:40:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:40:49,426 INFO L225 Difference]: With dead ends: 83 [2022-10-16 14:40:49,426 INFO L226 Difference]: Without dead ends: 73 [2022-10-16 14:40:49,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-10-16 14:40:49,429 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 81 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:40:49,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 77 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:40:49,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-16 14:40:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2022-10-16 14:40:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 53 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2022-10-16 14:40:49,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 13 [2022-10-16 14:40:49,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:40:49,457 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2022-10-16 14:40:49,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:40:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-10-16 14:40:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-10-16 14:40:49,458 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:40:49,458 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2022-10-16 14:40:49,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 14:40:49,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:40:49,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2022-10-16 14:40:49,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:40:49,673 INFO L85 PathProgramCache]: Analyzing trace with hash -101090604, now seen corresponding path program 2 times [2022-10-16 14:40:49,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:40:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624096006] [2022-10-16 14:40:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:40:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:40:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:40:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:40:51,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:40:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624096006] [2022-10-16 14:40:51,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624096006] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:40:51,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753815193] [2022-10-16 14:40:51,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-16 14:40:51,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:40:51,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:40:51,555 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) [2022-10-16 14:40:51,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:40:51,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-16 14:40:51,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-16 14:40:51,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2022-10-16 14:40:51,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:40:51,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-10-16 14:40:53,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2022-10-16 14:40:56,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-10-16 14:40:57,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-10-16 14:40:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:40:57,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:41:00,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (let ((.cse11 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (<= .cse17 2147483647))) (let ((.cse2 (+ .cse17 |c_~#array~0.offset|)) (.cse6 (not .cse10)) (.cse8 (+ .cse17 |c_~#array~0.offset| (- 4294967296))) (.cse3 (select |c_#memory_int| |c_~#array~0.base|)) (.cse0 (<= .cse11 2147483647))) (and (or (not .cse0) (let ((.cse4 (+ .cse11 |c_~#array~0.offset|))) (and (or (and (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse1 (store .cse3 .cse4 v_ArrVal_53))) (+ (select .cse1 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse1 .cse2))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_53))) (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse5 (store .cse3 .cse4 v_ArrVal_53))) (+ (select .cse5 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse5 .cse2))) 2147483648))) (< 127 v_ArrVal_53)))) .cse6) (or (and (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< (let ((.cse7 (store .cse3 .cse4 v_ArrVal_53))) (+ (select .cse7 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse7 .cse8))) 2147483648) (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_53))) (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (< (let ((.cse9 (store .cse3 .cse4 v_ArrVal_53))) (+ (select .cse9 .cse8) (select .cse9 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_53)))) .cse10)))) (or (let ((.cse13 (+ .cse11 |c_~#array~0.offset| (- 4294967296)))) (and (or (and (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse12 (store .cse3 .cse13 v_ArrVal_53))) (+ (select .cse12 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse12 .cse2))) 2147483648))) (< 127 v_ArrVal_53))) (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse14 (store .cse3 .cse13 v_ArrVal_53))) (+ (select .cse14 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse14 .cse2))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_53)))) .cse6) (or (and (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse15 (store .cse3 .cse13 v_ArrVal_53))) (+ (select .cse15 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse15 .cse8))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|))) (< 127 v_ArrVal_53))) (forall ((v_ArrVal_53 Int)) (or (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse16 (store .cse3 .cse13 v_ArrVal_53))) (+ (select .cse16 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse16 .cse8))) 2147483648))) (< 127 v_ArrVal_53)))) .cse10))) .cse0))))) is different from false [2022-10-16 14:41:03,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (mod |c_ULTIMATE.start_main_~j~0#1| 4294967296))) (let ((.cse11 (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296)) (.cse10 (<= .cse17 2147483647))) (let ((.cse8 (+ .cse17 |c_~#array~0.offset| (- 4294967296))) (.cse3 (+ .cse17 |c_~#array~0.offset|)) (.cse4 (select |c_#memory_int| |c_~#array~0.base|)) (.cse1 (not .cse10)) (.cse0 (<= .cse11 2147483647))) (and (or (not .cse0) (let ((.cse5 (+ .cse11 |c_~#array~0.offset|))) (and (or .cse1 (and (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse2 (store .cse4 .cse5 v_ArrVal_53))) (+ (select .cse2 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse2 .cse3))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< 127 v_ArrVal_53))) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse6 (store .cse4 .cse5 v_ArrVal_53))) (+ (select .cse6 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse6 .cse3))) 2147483648) (< 127 v_ArrVal_53))))) (or (and (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (< (let ((.cse7 (store .cse4 .cse5 v_ArrVal_53))) (+ (select .cse7 .cse8) (select .cse7 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))))) 2147483648) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< 127 v_ArrVal_53))) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (< (let ((.cse9 (store .cse4 .cse5 v_ArrVal_53))) (+ (select .cse9 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse9 .cse8))) 2147483648) (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< 127 v_ArrVal_53)))) .cse10)))) (or (let ((.cse13 (+ .cse11 |c_~#array~0.offset| (- 4294967296)))) (and (or (and (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse12 (store .cse4 .cse13 v_ArrVal_53))) (+ (select .cse12 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse12 .cse8))) 2147483648) (< 127 v_ArrVal_53))) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse14 (store .cse4 .cse13 v_ArrVal_53))) (+ (select .cse14 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse14 .cse8))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< 127 v_ArrVal_53)))) .cse10) (or (and (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (< |aux_mod_ULTIMATE.start_main_~k~0#1_45| 0) (< (let ((.cse15 (store .cse4 .cse13 v_ArrVal_53))) (+ (select .cse15 (+ |c_~#array~0.offset| (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse15 .cse3))) 2147483648) (< 2147483647 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< 127 v_ArrVal_53))) (forall ((|aux_mod_ULTIMATE.start_main_~k~0#1_45| Int) (v_ArrVal_53 Int)) (or (<= |aux_mod_ULTIMATE.start_main_~k~0#1_45| 2147483647) (<= 4294967296 |aux_mod_ULTIMATE.start_main_~k~0#1_45|) (< (let ((.cse16 (store .cse4 .cse13 v_ArrVal_53))) (+ (select .cse16 (+ |c_~#array~0.offset| (- 4294967296) (mod |aux_mod_ULTIMATE.start_main_~k~0#1_45| 4294967296))) (select .cse16 .cse3))) 2147483648) (< 127 v_ArrVal_53)))) .cse1))) .cse0))))) is different from false [2022-10-16 14:41:25,922 WARN L233 SmtUtils]: Spent 19.67s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)