/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:26:55,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:26:55,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:26:55,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:26:55,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:26:55,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:26:55,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:26:55,405 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:26:55,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:26:55,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:26:55,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:26:55,414 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:26:55,414 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:26:55,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:26:55,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:26:55,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:26:55,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:26:55,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:26:55,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:26:55,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:26:55,433 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:26:55,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:26:55,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:26:55,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:26:55,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:26:55,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:26:55,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:26:55,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:26:55,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:26:55,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:26:55,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:26:55,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:26:55,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:26:55,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:26:55,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:26:55,452 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:26:55,452 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:26:55,453 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:26:55,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:26:55,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:26:55,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:26:55,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:26:55,457 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:26:55,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:26:55,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:26:55,472 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:26:55,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:26:55,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:26:55,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:26:55,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:26:55,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:26:55,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:26:55,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:26:55,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:26:55,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:26:55,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:55,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:26:55,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:26:55,476 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:26:55,476 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:26:55,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:26:55,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:26:55,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:26:55,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:26:55,752 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:26:55,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-08 10:26:55,822 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db22d15aa/ef5946a610a94b238e35ebc8b1d17f03/FLAGaedd968f2 [2022-04-08 10:26:56,207 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:26:56,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-08 10:26:56,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db22d15aa/ef5946a610a94b238e35ebc8b1d17f03/FLAGaedd968f2 [2022-04-08 10:26:56,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db22d15aa/ef5946a610a94b238e35ebc8b1d17f03 [2022-04-08 10:26:56,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:26:56,621 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:26:56,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:56,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:26:56,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:26:56,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77db923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56, skipping insertion in model container [2022-04-08 10:26:56,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,634 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:26:56,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:26:56,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c[403,416] [2022-04-08 10:26:56,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:56,816 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:26:56,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c[403,416] [2022-04-08 10:26:56,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:26:56,847 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:26:56,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56 WrapperNode [2022-04-08 10:26:56,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:26:56,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:26:56,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:26:56,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:26:56,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,867 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:26:56,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:26:56,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:26:56,893 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:26:56,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (1/1) ... [2022-04-08 10:26:56,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:26:56,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:26:56,941 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-04-08 10:26:56,959 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-04-08 10:26:56,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:26:56,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:26:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:26:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:26:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:26:56,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:26:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:26:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:26:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:26:56,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:26:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:26:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:26:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:26:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:26:56,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:26:56,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:26:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:26:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:26:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:26:56,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:26:57,047 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:26:57,049 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:27:01,613 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:27:01,619 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:27:01,619 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:27:01,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:27:01 BoogieIcfgContainer [2022-04-08 10:27:01,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:27:01,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:27:01,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:27:01,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:27:01,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:26:56" (1/3) ... [2022-04-08 10:27:01,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747c6d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:27:01, skipping insertion in model container [2022-04-08 10:27:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:26:56" (2/3) ... [2022-04-08 10:27:01,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747c6d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:27:01, skipping insertion in model container [2022-04-08 10:27:01,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:27:01" (3/3) ... [2022-04-08 10:27:01,629 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-08 10:27:01,633 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:27:01,633 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:27:01,672 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:27:01,678 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 10:27:01,678 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:27:01,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 10:27:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 10:27:01,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:01,702 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:01,703 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:01,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-08 10:27:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:01,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1469869876] [2022-04-08 10:27:01,727 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:27:01,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 2 times [2022-04-08 10:27:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:01,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438327335] [2022-04-08 10:27:01,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:02,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-08 10:27:02,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 10:27:02,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-08 10:27:02,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:02,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-08 10:27:02,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 10:27:02,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-08 10:27:02,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-08 10:27:02,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:02,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:02,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:02,309 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:27:02,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:27:02,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-08 10:27:02,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 10:27:02,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:02,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:02,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438327335] [2022-04-08 10:27:02,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438327335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:02,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:02,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:02,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:02,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1469869876] [2022-04-08 10:27:02,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1469869876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:02,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:02,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:02,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054456078] [2022-04-08 10:27:02,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 10:27:02,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:02,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:02,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:02,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:27:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:27:02,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:27:02,364 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:04,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:09,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:11,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:13,741 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-08 10:27:13,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 10:27:13,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 10:27:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 10:27:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-08 10:27:13,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-08 10:27:13,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:13,833 INFO L225 Difference]: With dead ends: 47 [2022-04-08 10:27:13,833 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 10:27:13,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:27:13,838 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:13,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 6.5s Time] [2022-04-08 10:27:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 10:27:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-08 10:27:13,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:13,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,873 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,873 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:13,881 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 10:27:13,881 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 10:27:13,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:13,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:13,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:27:13,883 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 10:27:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:13,887 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 10:27:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 10:27:13,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:13,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:13,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:13,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-08 10:27:13,890 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-08 10:27:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:13,890 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-08 10:27:13,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:13,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-08 10:27:13,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-08 10:27:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 10:27:13,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:13,922 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:13,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:27:13,922 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-08 10:27:13,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:13,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851731731] [2022-04-08 10:27:13,941 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:27:13,941 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:27:13,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 2 times [2022-04-08 10:27:13,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:13,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856888115] [2022-04-08 10:27:13,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:13,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:14,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 10:27:14,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 10:27:14,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 10:27:14,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {231#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:14,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 10:27:14,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 10:27:14,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 10:27:14,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-08 10:27:14,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:14,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:14,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:14,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {226#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:27:14,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {226#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (= main_~k~0 0) (<= main_~v3~0 1) (= main_~j~0 0) (<= 1 main_~v3~0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {227#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} is VALID [2022-04-08 10:27:14,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= main_~v3~0 main_~l~0) (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v3~0))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {228#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} is VALID [2022-04-08 10:27:14,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {228#(and (= main_~k~0 0) (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~v3~0 (+ 4294967295 (* (div main_~l~0 4294967296) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:27:14,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {229#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {230#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:27:14,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {230#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {220#false} is VALID [2022-04-08 10:27:14,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-08 10:27:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:14,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856888115] [2022-04-08 10:27:14,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856888115] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:14,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502612085] [2022-04-08 10:27:14,609 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:27:14,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:14,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:27:14,619 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-04-08 10:27:14,645 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-04-08 10:27:14,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:27:14,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:27:14,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 10:27:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:14,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:27:15,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2022-04-08 10:27:15,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 10:27:15,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 10:27:15,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 10:27:15,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-08 10:27:15,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:15,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:15,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:15,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {259#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:15,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {259#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:15,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:15,166 INFO L272 TraceCheckUtils]: 11: Hoare triple {263#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:15,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:15,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {220#false} is VALID [2022-04-08 10:27:15,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-08 10:27:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:15,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:27:15,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-08 10:27:15,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {220#false} is VALID [2022-04-08 10:27:15,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:15,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:15,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:15,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:17,655 WARN L290 TraceCheckUtils]: 8: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {297#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:27:17,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:17,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:17,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {290#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:17,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-08 10:27:17,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-08 10:27:17,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-08 10:27:17,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-08 10:27:17,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {219#true} is VALID [2022-04-08 10:27:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 10:27:17,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502612085] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:17,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:27:17,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 7] total 16 [2022-04-08 10:27:17,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:17,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851731731] [2022-04-08 10:27:17,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851731731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:17,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:17,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:17,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140150624] [2022-04-08 10:27:17,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:27:17,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:17,665 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:19,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:19,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:27:19,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:19,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:27:19,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-04-08 10:27:19,816 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:21,922 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:26,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:30,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:33,190 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-08 10:27:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:27:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-08 10:27:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:33,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:27:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-08 10:27:33,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-08 10:27:35,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:35,371 INFO L225 Difference]: With dead ends: 27 [2022-04-08 10:27:35,371 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 10:27:35,371 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-04-08 10:27:35,372 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:35,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 60 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 6.3s Time] [2022-04-08 10:27:35,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 10:27:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 10:27:35,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:35,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:35,378 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:35,378 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:35,380 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 10:27:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:27:35,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:35,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:35,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 10:27:35,381 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 10:27:35,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:35,383 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-08 10:27:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-08 10:27:35,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:35,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:35,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:35,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-08 10:27:35,385 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 15 [2022-04-08 10:27:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:35,386 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-08 10:27:35,386 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:35,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions. [2022-04-08 10:27:37,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:37,533 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-08 10:27:37,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 10:27:37,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:37,534 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:37,554 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-04-08 10:27:37,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:37,735 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:37,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:37,735 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-08 10:27:37,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:37,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49813926] [2022-04-08 10:27:37,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:27:37,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:27:37,740 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 2 times [2022-04-08 10:27:37,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:37,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467758389] [2022-04-08 10:27:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:38,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:27:38,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:27:38,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {469#true} #71#return; {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:27:38,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {469#true} call ULTIMATE.init(); {477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:38,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:27:38,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:27:38,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {478#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {469#true} #71#return; {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:27:38,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:27:38,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {474#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {475#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:27:38,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {476#(= main_~l~0 0)} is VALID [2022-04-08 10:27:38,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {476#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {476#(= main_~l~0 0)} is VALID [2022-04-08 10:27:38,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {470#false} is VALID [2022-04-08 10:27:38,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {470#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {470#false} is VALID [2022-04-08 10:27:38,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#false} ~l~0 := 1 + ~l~0; {470#false} is VALID [2022-04-08 10:27:38,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {470#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {470#false} is VALID [2022-04-08 10:27:38,053 INFO L272 TraceCheckUtils]: 12: Hoare triple {470#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {470#false} is VALID [2022-04-08 10:27:38,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {470#false} ~cond := #in~cond; {470#false} is VALID [2022-04-08 10:27:38,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {470#false} assume 0 == ~cond; {470#false} is VALID [2022-04-08 10:27:38,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#false} assume !false; {470#false} is VALID [2022-04-08 10:27:38,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:38,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467758389] [2022-04-08 10:27:38,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467758389] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:38,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:38,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:38,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49813926] [2022-04-08 10:27:38,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49813926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:38,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458351351] [2022-04-08 10:27:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:38,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:27:38,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:38,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:40,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:40,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 10:27:40,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 10:27:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:27:40,239 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:48,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:51,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:27:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:51,451 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-08 10:27:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:27:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-08 10:27:51,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:27:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:51,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 10:27:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:51,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-08 10:27:51,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-08 10:27:53,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:53,676 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:27:53,676 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:27:53,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 10:27:53,677 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 60 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:27:53,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 26 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 10:27:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:27:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-08 10:27:53,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:27:53,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:53,711 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:53,711 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:53,713 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-08 10:27:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-08 10:27:53,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:53,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:53,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:27:53,714 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 10:27:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:27:53,715 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-08 10:27:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-08 10:27:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:27:53,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:27:53,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:27:53,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:27:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-08 10:27:53,718 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2022-04-08 10:27:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:27:53,718 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-08 10:27:53,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:27:53,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-08 10:27:55,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:27:55,871 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-08 10:27:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 10:27:55,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:27:55,872 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:27:55,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 10:27:55,872 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:27:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:27:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 1 times [2022-04-08 10:27:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:27:55,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708776379] [2022-04-08 10:27:55,878 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:27:55,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:27:55,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 2 times [2022-04-08 10:27:55,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:27:55,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826845313] [2022-04-08 10:27:55,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:27:55,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:27:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:55,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:27:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:55,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {656#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-08 10:27:55,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-08 10:27:55,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-08 10:27:55,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {656#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:27:55,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {656#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-08 10:27:55,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-08 10:27:55,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-08 10:27:55,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-08 10:27:55,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {654#(= main_~l~0 0)} is VALID [2022-04-08 10:27:55,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {654#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {654#(= main_~l~0 0)} is VALID [2022-04-08 10:27:55,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {654#(= main_~l~0 0)} is VALID [2022-04-08 10:27:55,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {654#(= main_~l~0 0)} is VALID [2022-04-08 10:27:55,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:55,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:55,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-08 10:27:55,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {655#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {650#false} is VALID [2022-04-08 10:27:55,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {650#false} ~l~0 := 1 + ~l~0; {650#false} is VALID [2022-04-08 10:27:55,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {650#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {650#false} is VALID [2022-04-08 10:27:55,987 INFO L272 TraceCheckUtils]: 15: Hoare triple {650#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {650#false} is VALID [2022-04-08 10:27:55,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {650#false} ~cond := #in~cond; {650#false} is VALID [2022-04-08 10:27:55,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {650#false} assume 0 == ~cond; {650#false} is VALID [2022-04-08 10:27:55,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-08 10:27:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:27:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826845313] [2022-04-08 10:27:55,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826845313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:55,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350920959] [2022-04-08 10:27:55,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:27:55,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:27:55,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:27:55,993 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-04-08 10:27:55,993 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-04-08 10:27:56,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:27:56,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:27:56,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:27:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:27:56,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:27:56,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-08 10:27:56,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-08 10:27:56,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-08 10:27:56,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-08 10:27:56,536 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-08 10:27:56,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:56,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:56,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:27:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {685#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {689#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {699#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} is VALID [2022-04-08 10:27:56,549 INFO L272 TraceCheckUtils]: 15: Hoare triple {703#(and (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:56,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:56,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-08 10:27:56,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-08 10:27:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:27:56,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:27:56,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-08 10:27:56,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-08 10:27:56,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {710#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {714#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:27:56,808 INFO L272 TraceCheckUtils]: 15: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {710#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:27:56,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:56,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:56,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:56,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:56,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:56,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:58,949 WARN L290 TraceCheckUtils]: 8: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {737#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:27:58,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:58,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:58,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {730#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:27:58,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret5 := main(); {649#true} is VALID [2022-04-08 10:27:58,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #71#return; {649#true} is VALID [2022-04-08 10:27:58,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-08 10:27:58,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {649#true} is VALID [2022-04-08 10:27:58,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-08 10:27:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:27:58,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350920959] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:27:58,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:27:58,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-08 10:27:58,956 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:27:58,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708776379] [2022-04-08 10:27:58,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708776379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:27:58,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:27:58,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:27:58,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072829057] [2022-04-08 10:27:58,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:27:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:27:58,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:27:58,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:01,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:01,118 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:28:01,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:28:01,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:28:01,119 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:03,240 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:05,491 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:07,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:07,938 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-04-08 10:28:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:28:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 10:28:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:28:07,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:07,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:28:07,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:28:07,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-08 10:28:10,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:10,122 INFO L225 Difference]: With dead ends: 33 [2022-04-08 10:28:10,122 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 10:28:10,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:28:10,123 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:28:10,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 6.2s Time] [2022-04-08 10:28:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 10:28:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-08 10:28:10,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:28:10,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:10,154 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:10,155 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:10,156 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-08 10:28:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-08 10:28:10,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:10,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:10,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:28:10,157 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-08 10:28:10,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:10,159 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-08 10:28:10,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-08 10:28:10,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:10,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:10,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:28:10,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:28:10,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-08 10:28:10,161 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 19 [2022-04-08 10:28:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:28:10,161 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-08 10:28:10,161 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:10,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-08 10:28:12,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:12,339 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-08 10:28:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 10:28:12,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:28:12,340 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:28:12,358 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-04-08 10:28:12,543 WARN L460 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-04-08 10:28:12,544 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:28:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:28:12,544 INFO L85 PathProgramCache]: Analyzing trace with hash 923887238, now seen corresponding path program 1 times [2022-04-08 10:28:12,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:12,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574804603] [2022-04-08 10:28:12,549 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:28:12,549 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:28:12,549 INFO L85 PathProgramCache]: Analyzing trace with hash 923887238, now seen corresponding path program 2 times [2022-04-08 10:28:12,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:28:12,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582629948] [2022-04-08 10:28:12,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:28:12,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:28:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:13,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:28:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:13,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {963#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:28:13,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:28:13,082 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {951#true} #71#return; {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:28:13,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {963#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:28:13,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {963#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:28:13,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:28:13,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {964#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {951#true} #71#return; {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:28:13,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:28:13,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {956#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {957#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:28:13,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {957#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {958#(= main_~l~0 0)} is VALID [2022-04-08 10:28:13,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {958#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {958#(= main_~l~0 0)} is VALID [2022-04-08 10:28:13,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {958#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {958#(= main_~l~0 0)} is VALID [2022-04-08 10:28:13,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {958#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {959#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:28:13,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {959#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:28:13,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:28:13,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:28:13,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {961#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:28:13,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {961#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {962#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-08 10:28:13,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {962#(<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 2147483648) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {952#false} is VALID [2022-04-08 10:28:13,114 INFO L272 TraceCheckUtils]: 16: Hoare triple {952#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {952#false} is VALID [2022-04-08 10:28:13,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {952#false} ~cond := #in~cond; {952#false} is VALID [2022-04-08 10:28:13,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {952#false} assume 0 == ~cond; {952#false} is VALID [2022-04-08 10:28:13,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-08 10:28:13,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:28:13,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582629948] [2022-04-08 10:28:13,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582629948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:28:13,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510114113] [2022-04-08 10:28:13,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:28:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:28:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:28:13,120 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-04-08 10:28:13,121 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-04-08 10:28:13,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:28:13,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:28:13,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:28:13,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:13,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:28:13,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2022-04-08 10:28:13,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {951#true} is VALID [2022-04-08 10:28:13,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2022-04-08 10:28:13,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #71#return; {951#true} is VALID [2022-04-08 10:28:13,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret5 := main(); {951#true} is VALID [2022-04-08 10:28:13,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:13,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:13,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:13,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {993#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:28:13,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {993#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:28:13,782 INFO L290 TraceCheckUtils]: 10: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:28:13,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:28:13,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-08 10:28:13,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1010#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:28:13,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} ~l~0 := 1 + ~l~0; {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:28:13,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-08 10:28:13,786 INFO L272 TraceCheckUtils]: 16: Hoare triple {1014#(and (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:28:13,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:28:13,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {952#false} is VALID [2022-04-08 10:28:13,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-08 10:28:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:13,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:28:14,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {952#false} assume !false; {952#false} is VALID [2022-04-08 10:28:14,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {1025#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {952#false} is VALID [2022-04-08 10:28:14,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1025#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:28:14,225 INFO L272 TraceCheckUtils]: 16: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1021#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:28:14,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:14,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:16,337 WARN L290 TraceCheckUtils]: 13: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:28:16,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:16,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:16,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:16,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:18,474 WARN L290 TraceCheckUtils]: 8: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1048#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:28:18,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:18,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:18,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {951#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1041#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:18,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {951#true} call #t~ret5 := main(); {951#true} is VALID [2022-04-08 10:28:18,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {951#true} {951#true} #71#return; {951#true} is VALID [2022-04-08 10:28:18,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {951#true} assume true; {951#true} is VALID [2022-04-08 10:28:18,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {951#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {951#true} is VALID [2022-04-08 10:28:18,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {951#true} call ULTIMATE.init(); {951#true} is VALID [2022-04-08 10:28:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:28:18,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510114113] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:28:18,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:28:18,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 9] total 20 [2022-04-08 10:28:18,477 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:28:18,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [574804603] [2022-04-08 10:28:18,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [574804603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:28:18,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:28:18,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:28:18,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485206261] [2022-04-08 10:28:18,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:28:18,478 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:28:18,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:28:18,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:22,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 16 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:22,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:28:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:22,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:28:22,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-08 10:28:22,735 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:24,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:27,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:29,561 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-08 10:28:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:28:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 10:28:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:28:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:28:29,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-08 10:28:29,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-08 10:28:33,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 33 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:33,864 INFO L225 Difference]: With dead ends: 34 [2022-04-08 10:28:33,864 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 10:28:33,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-08 10:28:33,865 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:28:33,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 48 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-08 10:28:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 10:28:33,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-08 10:28:33,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:28:33,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:33,898 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:33,898 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:33,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:33,899 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-08 10:28:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-08 10:28:33,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:33,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:33,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:28:33,900 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-08 10:28:33,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:33,902 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-04-08 10:28:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2022-04-08 10:28:33,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:33,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:33,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:28:33,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:28:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:33,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-08 10:28:33,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 20 [2022-04-08 10:28:33,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:28:33,904 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-08 10:28:33,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:33,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-08 10:28:38,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-08 10:28:38,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 10:28:38,249 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:28:38,249 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:28:38,277 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-04-08 10:28:38,450 WARN L460 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-04-08 10:28:38,450 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:28:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:28:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -844641793, now seen corresponding path program 1 times [2022-04-08 10:28:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:38,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [909294123] [2022-04-08 10:28:38,456 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:28:38,456 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:28:38,457 INFO L85 PathProgramCache]: Analyzing trace with hash -844641793, now seen corresponding path program 2 times [2022-04-08 10:28:38,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:28:38,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040882754] [2022-04-08 10:28:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:28:38,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:28:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:38,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:28:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:38,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-08 10:28:38,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-08 10:28:38,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-08 10:28:38,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:28:38,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1278#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-08 10:28:38,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-08 10:28:38,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-08 10:28:38,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-08 10:28:38,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1276#(= main_~l~0 0)} is VALID [2022-04-08 10:28:38,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1276#(= main_~l~0 0)} is VALID [2022-04-08 10:28:38,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1276#(= main_~l~0 0)} is VALID [2022-04-08 10:28:38,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {1276#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1276#(= main_~l~0 0)} is VALID [2022-04-08 10:28:38,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {1276#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:28:38,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:28:38,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:28:38,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:28:38,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {1277#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1272#false} ~l~0 := 1 + ~l~0; {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1272#false} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L272 TraceCheckUtils]: 17: Hoare triple {1272#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {1272#false} assume 0 == ~cond; {1272#false} is VALID [2022-04-08 10:28:38,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-08 10:28:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:28:38,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040882754] [2022-04-08 10:28:38,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040882754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:28:38,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554448617] [2022-04-08 10:28:38,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:28:38,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:28:38,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:28:38,579 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-04-08 10:28:38,580 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-04-08 10:28:38,622 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:28:38,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:28:38,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 10:28:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:28:38,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:28:39,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2022-04-08 10:28:39,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-08 10:28:39,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-08 10:28:39,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-08 10:28:39,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-08 10:28:39,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:39,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:39,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:28:39,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {1297#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {1311#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1327#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {1327#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:28:39,197 INFO L272 TraceCheckUtils]: 17: Hoare triple {1331#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:28:39,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:28:39,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1272#false} is VALID [2022-04-08 10:28:39,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-08 10:28:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:28:39,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:28:39,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-04-08 10:28:39,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1272#false} is VALID [2022-04-08 10:28:39,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1342#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:28:39,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1338#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:28:39,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:39,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:41,622 WARN L290 TraceCheckUtils]: 8: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1365#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:28:41,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:41,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:41,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1358#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:28:41,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret5 := main(); {1271#true} is VALID [2022-04-08 10:28:41,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #71#return; {1271#true} is VALID [2022-04-08 10:28:41,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2022-04-08 10:28:41,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1271#true} is VALID [2022-04-08 10:28:41,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2022-04-08 10:28:41,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-08 10:28:41,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554448617] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:28:41,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:28:41,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-08 10:28:41,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:28:41,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [909294123] [2022-04-08 10:28:41,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [909294123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:28:41,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:28:41,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:28:41,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896148795] [2022-04-08 10:28:41,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:28:41,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:28:41,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:28:41,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:43,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:43,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:28:43,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:28:43,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:28:43,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-08 10:28:43,799 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:45,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:48,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:50,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:52,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:28:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:54,952 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-08 10:28:54,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:28:54,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 10:28:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:28:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-08 10:28:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-08 10:28:54,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-08 10:28:57,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 10:28:57,181 INFO L225 Difference]: With dead ends: 41 [2022-04-08 10:28:57,181 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:28:57,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-08 10:28:57,182 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-08 10:28:57,182 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-04-08 10:28:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:28:57,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:28:57,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:28:57,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:57,231 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:57,231 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:57,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:57,232 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-08 10:28:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-08 10:28:57,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:57,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:57,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:28:57,233 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-08 10:28:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:28:57,235 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-08 10:28:57,235 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-08 10:28:57,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:28:57,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:28:57,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:28:57,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:28:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 31 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-08 10:28:57,237 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 50 transitions. Word has length 21 [2022-04-08 10:28:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:28:57,237 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 50 transitions. [2022-04-08 10:28:57,237 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:28:57,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-08 10:29:06,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 46 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 50 transitions. [2022-04-08 10:29:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 10:29:06,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:29:06,051 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:29:06,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:06,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:06,252 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:29:06,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:29:06,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1948928856, now seen corresponding path program 1 times [2022-04-08 10:29:06,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:06,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328492570] [2022-04-08 10:29:06,261 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 10:29:06,261 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 10:29:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1948928856, now seen corresponding path program 2 times [2022-04-08 10:29:06,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:29:06,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888428007] [2022-04-08 10:29:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:29:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:29:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:29:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:06,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:06,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:06,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1641#true} #71#return; {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:06,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1654#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:29:06,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1654#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:06,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 10:29:06,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1655#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1641#true} #71#return; {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:06,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:06,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {1646#(and (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1647#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-08 10:29:06,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {1647#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1648#(= main_~l~0 0)} is VALID [2022-04-08 10:29:06,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1648#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1648#(= main_~l~0 0)} is VALID [2022-04-08 10:29:06,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {1648#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1648#(= main_~l~0 0)} is VALID [2022-04-08 10:29:06,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {1648#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1649#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:29:06,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1649#(<= (+ (* (div (+ (* (- 1) main_~l~0) (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) 2 (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) (* (div main_~l~0 4294967296) 4294967298)) 2) 4294967296) 1) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:29:06,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:29:06,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:29:06,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {1650#(<= (+ (* (div (+ (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3) 6442450944) (* 9223372041149743104 (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~n~0 4294967296) 4294967296) (* main_~l~0 (- 2147483647)) (* 9223372036854775808 (div main_~l~0 4294967296)) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1651#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} is VALID [2022-04-08 10:29:06,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#(<= (+ (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 6442450944 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~l~0)} ~l~0 := 1 + ~l~0; {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} is VALID [2022-04-08 10:29:06,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {1652#(<= (+ 2 (* (div (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 6442450943) 4294967296) 4294967296)) main_~l~0)} ~l~0 := 1 + ~l~0; {1653#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} is VALID [2022-04-08 10:29:06,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {1653#(<= (+ 2147483647 main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296)))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1642#false} is VALID [2022-04-08 10:29:06,764 INFO L272 TraceCheckUtils]: 22: Hoare triple {1642#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1642#false} is VALID [2022-04-08 10:29:06,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2022-04-08 10:29:06,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {1642#false} assume 0 == ~cond; {1642#false} is VALID [2022-04-08 10:29:06,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-08 10:29:06,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:06,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:29:06,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888428007] [2022-04-08 10:29:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888428007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 10:29:06,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531997547] [2022-04-08 10:29:06,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:29:06,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:06,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:29:06,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:29:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 10:29:06,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:29:06,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:29:06,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 10:29:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:29:06,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:29:07,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2022-04-08 10:29:07,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1641#true} is VALID [2022-04-08 10:29:07,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2022-04-08 10:29:07,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #71#return; {1641#true} is VALID [2022-04-08 10:29:07,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret5 := main(); {1641#true} is VALID [2022-04-08 10:29:07,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {1641#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:29:07,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:29:07,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-08 10:29:07,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1674#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1684#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {1684#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1701#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {1705#(and (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1721#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {1721#(and (= main_~l~0 2) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} is VALID [2022-04-08 10:29:07,646 INFO L272 TraceCheckUtils]: 22: Hoare triple {1725#(and (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:07,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:07,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1642#false} is VALID [2022-04-08 10:29:07,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-08 10:29:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 10:29:07,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:29:08,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2022-04-08 10:29:08,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1736#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1642#false} is VALID [2022-04-08 10:29:08,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1736#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:29:08,152 INFO L272 TraceCheckUtils]: 22: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1732#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:29:08,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:08,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:10,304 WARN L290 TraceCheckUtils]: 13: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:29:10,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:10,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:10,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:10,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:12,430 WARN L290 TraceCheckUtils]: 8: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1759#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-08 10:29:12,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:12,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:12,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1641#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1752#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))} is VALID [2022-04-08 10:29:12,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret5 := main(); {1641#true} is VALID [2022-04-08 10:29:12,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #71#return; {1641#true} is VALID [2022-04-08 10:29:12,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2022-04-08 10:29:12,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1641#true} is VALID [2022-04-08 10:29:12,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2022-04-08 10:29:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 10:29:12,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531997547] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 10:29:12,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:29:12,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 11] total 23 [2022-04-08 10:29:12,433 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:29:12,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328492570] [2022-04-08 10:29:12,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328492570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:29:12,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:29:12,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:29:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919408767] [2022-04-08 10:29:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:29:12,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:29:12,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:29:12,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:16,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 18 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:16,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:29:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:29:16,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:29:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2022-04-08 10:29:16,735 INFO L87 Difference]: Start difference. First operand 36 states and 50 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:18,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:23,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 10:29:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:23,607 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-04-08 10:29:23,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:29:23,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-08 10:29:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:29:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:23,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-08 10:29:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-04-08 10:29:23,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 22 transitions. [2022-04-08 10:29:27,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:27,942 INFO L225 Difference]: With dead ends: 36 [2022-04-08 10:29:27,942 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:29:27,942 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-04-08 10:29:27,943 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-08 10:29:27,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.2s Time] [2022-04-08 10:29:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:29:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:29:27,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:29:27,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 10:29:27,944 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 10:29:27,944 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 10:29:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:27,944 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:29:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:29:27,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:27,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:27,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-08 10:29:27,944 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-04-08 10:29:27,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:29:27,945 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:27,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:29:27,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:29:27,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:29:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-04-08 10:29:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 10:29:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:29:27,945 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 10:29:27,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:29:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:29:27,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:29:27,948 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:29:27,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 10:29:28,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:29:28,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-08 10:29:28,750 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,750 INFO L878 garLoopResultBuilder]: At program point L27(lines 27 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 23 32) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001)) (= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L25(lines 25 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 16 37) the Hoare annotation is: true [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L23(lines 23 32) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L21-2(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L21-3(lines 21 34) the Hoare annotation is: (or (= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 16 37) the Hoare annotation is: true [2022-04-08 10:29:28,751 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 16 37) the Hoare annotation is: true [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0)) (not (<= 20000001 ~SIZE~0)) (not (<= ~SIZE~0 20000001))) [2022-04-08 10:29:28,751 INFO L885 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-08 10:29:28,751 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-08 10:29:28,752 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2022-04-08 10:29:28,752 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:29:28,752 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:29:28,752 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point L9(lines 9 11) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 10:29:28,752 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 10:29:28,755 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-08 10:29:28,756 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:29:28,759 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:29:28,761 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 10:29:28,762 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:29:28,763 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:29:28,763 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-08 10:29:28,767 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-08 10:29:33,062 INFO L163 areAnnotationChecker]: CFG has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:29:33,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:29:33 BoogieIcfgContainer [2022-04-08 10:29:33,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:29:33,076 INFO L158 Benchmark]: Toolchain (without parser) took 156453.84ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 117.3MB in the beginning and 110.5MB in the end (delta: 6.7MB). Peak memory consumption was 41.7MB. Max. memory is 8.0GB. [2022-04-08 10:29:33,076 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 168.8MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:29:33,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.61ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 117.1MB in the beginning and 179.7MB in the end (delta: -62.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-08 10:29:33,077 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 203.4MB. Free memory was 179.7MB in the beginning and 178.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:29:33,077 INFO L158 Benchmark]: RCFGBuilder took 4728.20ms. Allocated memory is still 203.4MB. Free memory was 178.1MB in the beginning and 166.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 10:29:33,077 INFO L158 Benchmark]: TraceAbstraction took 151450.65ms. Allocated memory is still 203.4MB. Free memory was 165.6MB in the beginning and 110.5MB in the end (delta: 55.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-04-08 10:29:33,078 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 168.8MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.61ms. Allocated memory was 168.8MB in the beginning and 203.4MB in the end (delta: 34.6MB). Free memory was 117.1MB in the beginning and 179.7MB in the end (delta: -62.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 203.4MB. Free memory was 179.7MB in the beginning and 178.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 4728.20ms. Allocated memory is still 203.4MB. Free memory was 178.1MB in the beginning and 166.1MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 151450.65ms. Allocated memory is still 203.4MB. Free memory was 165.6MB in the beginning and 110.5MB in the end (delta: 55.1MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 147.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 85.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 39.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 304 SdHoareTripleChecker+Invalid, 38.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 97 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 160 SyntacticMatches, 15 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=6, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 25 LocationsWithAnnotation, 67 PreInvPairs, 102 NumberOfFragments, 255 HoareAnnotationTreeSize, 67 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 25 FomulaSimplificationsInter, 643 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (l % 4294967296 == (i + k + j + v3 + v4) % 4294967296 || !(20000001 <= SIZE)) || !(SIZE <= 20000001) - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 10:29:33,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...