/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:08:13,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:08:13,506 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:08:13,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:08:13,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:08:13,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:08:13,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:08:13,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:08:13,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:08:13,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:08:13,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:08:13,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:08:13,565 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:08:13,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:08:13,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:08:13,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:08:13,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:08:13,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:08:13,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:08:13,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:08:13,572 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:08:13,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:08:13,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:08:13,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:08:13,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:08:13,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:08:13,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:08:13,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:08:13,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:08:13,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:08:13,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:08:13,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:08:13,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:08:13,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:08:13,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:08:13,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:08:13,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:08:13,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:08:13,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:08:13,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:08:13,591 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:08:13,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:08:13,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:08:13,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:08:13,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:08:13,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:08:13,606 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:08:13,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:08:13,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:08:13,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:08:13,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:08:13,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:08:13,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:08:13,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:08:13,608 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:13,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:08:13,609 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:08:13,610 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 04:08:13,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:08:13,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:08:13,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:08:13,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:08:13,842 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:08:13,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-08 04:08:13,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf660031/f337e5ad04874fd4be47beb1369c4fe4/FLAG9d4136e74 [2022-04-08 04:08:14,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:08:14,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/iftelse.c [2022-04-08 04:08:14,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf660031/f337e5ad04874fd4be47beb1369c4fe4/FLAG9d4136e74 [2022-04-08 04:08:14,697 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf660031/f337e5ad04874fd4be47beb1369c4fe4 [2022-04-08 04:08:14,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:08:14,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:08:14,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:14,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:08:14,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:08:14,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748de3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14, skipping insertion in model container [2022-04-08 04:08:14,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:08:14,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:08:14,871 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/iftelse.c[406,419] [2022-04-08 04:08:14,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:14,891 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:08:14,903 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/iftelse.c[406,419] [2022-04-08 04:08:14,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:08:14,918 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:08:14,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14 WrapperNode [2022-04-08 04:08:14,918 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:08:14,919 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:08:14,919 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:08:14,919 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:08:14,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,951 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:08:14,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:08:14,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:08:14,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:08:14,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (1/1) ... [2022-04-08 04:08:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:08:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:08:14,989 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 04:08:14,998 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 04:08:15,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:08:15,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:08:15,022 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:08:15,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:08:15,022 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:08:15,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:08:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:08:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:08:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:08:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:08:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:08:15,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:08:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:08:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:08:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:08:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:08:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:08:15,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:08:15,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:08:15,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:08:15,077 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:08:15,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:08:15,183 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:08:15,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:08:15,196 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:08:15,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:15 BoogieIcfgContainer [2022-04-08 04:08:15,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:08:15,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:08:15,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:08:15,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:08:15,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:08:14" (1/3) ... [2022-04-08 04:08:15,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852f061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:15, skipping insertion in model container [2022-04-08 04:08:15,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:14" (2/3) ... [2022-04-08 04:08:15,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852f061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:15, skipping insertion in model container [2022-04-08 04:08:15,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:15" (3/3) ... [2022-04-08 04:08:15,208 INFO L111 eAbstractionObserver]: Analyzing ICFG iftelse.c [2022-04-08 04:08:15,213 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:08:15,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:08:15,257 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:08:15,264 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 04:08:15,264 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:08:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 04:08:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:08:15,289 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:15,290 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:15,290 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:15,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 1 times [2022-04-08 04:08:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:15,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1476943000] [2022-04-08 04:08:15,310 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:08:15,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1034116429, now seen corresponding path program 2 times [2022-04-08 04:08:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:15,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410912410] [2022-04-08 04:08:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:15,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:15,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-08 04:08:15,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:08:15,959 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 04:08:15,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:15,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {25#true} is VALID [2022-04-08 04:08:15,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 04:08:15,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-08 04:08:15,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret5 := main(); {25#true} is VALID [2022-04-08 04:08:15,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {25#true} is VALID [2022-04-08 04:08:15,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {30#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:08:15,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(and (= main_~j~0 0) (= main_~i~0 0))} assume !!(~i~0 % 4294967296 < ~n~0 % 4294967296);~i~0 := 3 + ~i~0; {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:08:15,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 04:08:15,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} assume ~n~0 % 4294967296 > 0; {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 04:08:15,973 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ 2 (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296)) 0)) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:08:15,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:08:15,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-08 04:08:15,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 04:08:15,976 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 04:08:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410912410] [2022-04-08 04:08:15,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410912410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:15,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:15,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:08:15,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1476943000] [2022-04-08 04:08:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1476943000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:15,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:15,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:08:15,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231647656] [2022-04-08 04:08:15,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:15,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-08 04:08:15,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:15,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 04:08:16,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:16,022 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:08:16,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:08:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:08:16,049 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 16 states have internal predecessors, (21), 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 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 04:08:18,437 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 04:08:20,522 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:22,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:27,101 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 04:08:31,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:33,287 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 04:08:35,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:37,483 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 04:08:39,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:41,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:45,905 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 04:08:46,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:46,012 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-08 04:08:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:08:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-08 04:08:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 04:08:46,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-08 04:08:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 04:08:46,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2022-04-08 04:08:46,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2022-04-08 04:08:46,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:46,134 INFO L225 Difference]: With dead ends: 53 [2022-04-08 04:08:46,135 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:08:46,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:08:46,143 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 12 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:46,144 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 55 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 127 Invalid, 10 Unknown, 0 Unchecked, 23.1s Time] [2022-04-08 04:08:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:08:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-08 04:08:46,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:46,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:46,210 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:46,211 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:46,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:46,221 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:08:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:08:46,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:46,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:46,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:08:46,225 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:08:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:46,231 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:08:46,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:08:46,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:46,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:46,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:46,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-08 04:08:46,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2022-04-08 04:08:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:46,241 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-08 04:08:46,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 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 04:08:46,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-08 04:08:46,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-08 04:08:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:08:46,288 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:46,288 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:46,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:08:46,289 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:46,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash -244126219, now seen corresponding path program 1 times [2022-04-08 04:08:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:46,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012980653] [2022-04-08 04:08:46,911 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:08:46,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:08:46,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1655658973, now seen corresponding path program 1 times [2022-04-08 04:08:46,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:08:46,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687832559] [2022-04-08 04:08:46,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:08:46,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:08:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:47,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:08:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:08:47,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-08 04:08:47,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-08 04:08:47,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-08 04:08:47,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {260#true} call ULTIMATE.init(); {270#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:08:47,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {260#true} is VALID [2022-04-08 04:08:47,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume true; {260#true} is VALID [2022-04-08 04:08:47,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#true} {260#true} #61#return; {260#true} is VALID [2022-04-08 04:08:47,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#true} call #t~ret5 := main(); {260#true} is VALID [2022-04-08 04:08:47,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {260#true} is VALID [2022-04-08 04:08:47,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {265#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:08:47,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#(and (= main_~j~0 0) (= main_~i~0 0))} [65] L28-->L24_primed: Formula: (let ((.cse0 (= v_main_~i~0_11 v_main_~i~0_10)) (.cse1 (= v_main_~j~0_8 v_main_~j~0_7))) (or (and .cse0 .cse1 (= v_main_~n~0_10 v_main_~n~0_10)) (and .cse0 .cse1))) InVars {main_~i~0=v_main_~i~0_11, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_10, main_~n~0=v_main_~n~0_10, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {265#(and (= main_~j~0 0) (= main_~i~0 0))} is VALID [2022-04-08 04:08:47,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(and (= main_~j~0 0) (= main_~i~0 0))} [64] L24_primed-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {266#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} is VALID [2022-04-08 04:08:47,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#(and (= main_~j~0 0) (<= 3 main_~i~0) (<= main_~i~0 3))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {267#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 04:08:47,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {267#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} assume ~n~0 % 4294967296 > 0; {267#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} is VALID [2022-04-08 04:08:47,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(and (not (<= (+ (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 1) (div main_~j~0 4294967296))) (not (<= (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 2) (div main_~i~0 4294967296) 1) (* 2 (div main_~j~0 4294967296)))) (<= (+ main_~i~0 3) (* main_~j~0 2)))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:08:47,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:08:47,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {261#false} is VALID [2022-04-08 04:08:47,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-04-08 04:08:47,201 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 04:08:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:08:47,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687832559] [2022-04-08 04:08:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687832559] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:08:47,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:08:47,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012980653] [2022-04-08 04:08:47,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012980653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:08:47,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:08:47,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:08:47,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535557116] [2022-04-08 04:08:47,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:08:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 17 [2022-04-08 04:08:47,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:08:47,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 04:08:47,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:47,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 04:08:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:47,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 04:08:47,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:08:47,311 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 04:08:49,519 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 04:08:51,710 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 04:08:53,864 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 04:08:55,948 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-08 04:08:58,111 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 04:08:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:58,113 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 04:08:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:08:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 17 [2022-04-08 04:08:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:08:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 04:08:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 04:08:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 04:08:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-08 04:08:58,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-08 04:08:58,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:58,259 INFO L225 Difference]: With dead ends: 36 [2022-04-08 04:08:58,259 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 04:08:58,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-08 04:08:58,261 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2022-04-08 04:08:58,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 49 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2022-04-08 04:08:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 04:08:58,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 04:08:58,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:08:58,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:58,280 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:58,280 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:58,283 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 04:08:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 04:08:58,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:58,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:58,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 04:08:58,286 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 04:08:58,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:08:58,294 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 04:08:58,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 04:08:58,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:08:58,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:08:58,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:08:58,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:08:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:08:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 04:08:58,298 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2022-04-08 04:08:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:08:58,298 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 04:08:58,299 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 04:08:58,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 04:08:58,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:08:58,334 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 04:08:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 04:08:58,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:08:58,338 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:08:58,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:08:58,340 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:08:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:08:58,342 INFO L85 PathProgramCache]: Analyzing trace with hash 722095884, now seen corresponding path program 1 times [2022-04-08 04:08:58,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:08:58,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1879693310] [2022-04-08 04:11:53,139 WARN L232 SmtUtils]: Spent 2.02m on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-08 04:11:57,396 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:11:59,523 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-08 04:13:41,376 WARN L232 SmtUtils]: Spent 1.66m on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:13:41,393 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:13:41,400 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:13:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1673647587, now seen corresponding path program 1 times [2022-04-08 04:13:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:13:41,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927316400] [2022-04-08 04:13:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:13:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:13:41,421 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= .v_it_2.0 (+ (* (- 1) main_~i~0_6) (* 2 (div (+ main_~i~0_6 .v_it_2.0 1) 2)) (- 1)))) [2022-04-08 04:13:41,426 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_2.0) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_2.0)) 4294967296))) 0)) [2022-04-08 04:13:41,426 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (let ((.cse1 (* 3 .v_it_2.0))) (let ((.cse0 (div (+ main_~i~0_6 .cse1 (* (- 4294967296) (div (+ main_~i~0_6 .cse1 3) 4294967296)) 3) 2))) (+ .cse0 (* (- 4294967296) (div .cse0 4294967296)) (* (- 1) main_~j~0_6) (* (- 3) .v_it_2.0) (* 4294967296 (div (+ main_~j~0_6 .cse1 3) 4294967296)) (- 3)))) 0) [2022-04-08 04:13:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:13:41,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (= .v_it_2.4 (+ (* (- 1) main_~i~0_6) (* 2 (div (+ main_~i~0_6 .v_it_2.4 1) 2)) (- 1)))) [2022-04-08 04:13:41,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ main_~n~0_5 (* (- 4294967296) (div main_~n~0_5 4294967296)) (* (- 1) main_~i~0_6) (* (- 3) .v_it_2.4) (* 4294967296 (div (+ main_~i~0_6 (* 3 .v_it_2.4)) 4294967296))) 0)) [2022-04-08 04:13:41,492 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (let ((.cse1 (* 3 .v_it_2.4))) (let ((.cse0 (div (+ main_~i~0_6 .cse1 (* (- 4294967296) (div (+ main_~i~0_6 .cse1 3) 4294967296)) 3) 2))) (+ .cse0 (* (- 4294967296) (div .cse0 4294967296)) (* (- 1) main_~j~0_6) (* (- 3) .v_it_2.4) (* 4294967296 (div (+ main_~j~0_6 .cse1 3) 4294967296)) (- 3)))) 0) [2022-04-08 04:13:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:13:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:13:41,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {473#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,829 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {461#true} #61#return; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {473#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:13:41,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {473#(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(10, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {461#true} #61#return; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} call #t~ret5 := main(); {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} havoc ~n~0;havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := #t~nondet4;havoc #t~nondet4; {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-08 04:13:41,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := 0;~j~0 := ~k~0;~i~0 := ~j~0; {467#(and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-08 04:13:41,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(and (= main_~j~0 0) (= main_~i~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} [67] L28-->L24_primed: Formula: (let ((.cse3 (< (mod v_main_~i~0_20 4294967296) (mod v_main_~n~0_12 4294967296))) (.cse0 (<= (mod (div (mod (+ v_main_~i~0_20 3) 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_17 3) 4294967296))) (.cse2 (= (mod (+ v_main_~i~0_20 1) 2) 0)) (.cse5 (= v_main_~i~0_20 v_main_~i~0_19)) (.cse6 (= v_main_~j~0_17 v_main_~j~0_16))) (or (let ((.cse1 (div (+ v_main_~j~0_17 (* v_main_~j~0_16 (- 1))) (- 3)))) (and .cse0 (< 0 .cse1) (not .cse2) (= v_main_~i~0_19 (+ v_main_~i~0_20 (* 3 .cse1))) .cse3 (= (mod (+ v_main_~j~0_17 (* v_main_~j~0_16 2)) 3) 0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 1) (div (+ v_main_~j~0_17 (* v_main_~j~0_16 (- 1))) (- 3)))) (let ((.cse4 (* v_it_2 3))) (and (<= (mod (div (mod (+ v_main_~i~0_20 3 .cse4) 4294967296) 2) 4294967296) (mod (+ v_main_~j~0_17 3 .cse4) 4294967296)) (< (mod (+ v_main_~i~0_20 .cse4) 4294967296) (mod v_main_~n~0_12 4294967296)) (not (= 0 (mod (+ v_main_~i~0_20 v_it_2 1) 2))))))))) (and .cse5 (= v_main_~n~0_12 v_main_~n~0_12) .cse6) (and (or (not .cse3) (not .cse0) .cse2) .cse5 .cse6))) InVars {main_~i~0=v_main_~i~0_20, main_~n~0=v_main_~n~0_12, main_~j~0=v_main_~j~0_17} OutVars{main_~i~0=v_main_~i~0_19, main_~n~0=v_main_~n~0_12, main_~j~0=v_main_~j~0_16} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {468#(or (and (<= main_~i~0 (* main_~j~0 2)) (<= 0 main_~i~0) (<= main_~j~0 0)) (and (<= (+ main_~n~0 main_~j~0) (+ 20000001 main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ main_~j~0 2))))} is VALID [2022-04-08 04:13:41,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {468#(or (and (<= main_~i~0 (* main_~j~0 2)) (<= 0 main_~i~0) (<= main_~j~0 0)) (and (<= (+ main_~n~0 main_~j~0) (+ 20000001 main_~i~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~i~0 (+ main_~j~0 2))))} [66] L24_primed-->L24: Formula: (and (= v_main_~i~0_5 (+ v_main_~i~0_6 3)) (< (mod v_main_~i~0_6 4294967296) (mod v_main_~n~0_9 4294967296))) InVars {main_~i~0=v_main_~i~0_6, main_~n~0=v_main_~n~0_9} OutVars{main_~i~0=v_main_~i~0_5, main_~n~0=v_main_~n~0_9} AuxVars[] AssignedVars[main_~i~0] {469#(<= (+ main_~i~0 (* (div (+ (* (- 1) main_~i~0) (* (- 8589934592) (div (+ 20000000 (* (- 1) main_~j~0)) 4294967296)) 4294967298) 4294967296) 4294967296)) (+ 7 (* main_~j~0 2)))} is VALID [2022-04-08 04:13:41,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {469#(<= (+ main_~i~0 (* (div (+ (* (- 1) main_~i~0) (* (- 8589934592) (div (+ 20000000 (* (- 1) main_~j~0)) 4294967296)) 4294967298) 4294967296) 4294967296)) (+ 7 (* main_~j~0 2)))} assume 0 != (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then ~i~0 % 4294967296 % 2 - 2 else ~i~0 % 4294967296 % 2) % 4294967296;~j~0 := 3 + ~j~0; {470#(<= (+ (* 8589934592 (div main_~j~0 4294967296)) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) (* main_~j~0 2) (* (div main_~i~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 04:13:41,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {470#(<= (+ (* 8589934592 (div main_~j~0 4294967296)) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) (* main_~j~0 2) (* (div main_~i~0 4294967296) 4294967296) 1))} assume ~n~0 % 4294967296 > 0; {470#(<= (+ (* 8589934592 (div main_~j~0 4294967296)) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) (* main_~j~0 2) (* (div main_~i~0 4294967296) 4294967296) 1))} is VALID [2022-04-08 04:13:41,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {470#(<= (+ (* 8589934592 (div main_~j~0 4294967296)) main_~i~0) (+ (* (div (div (+ (* (div main_~i~0 4294967296) (- 4294967296)) main_~i~0) 2) 4294967296) 8589934592) (* main_~j~0 2) (* (div main_~i~0 4294967296) 4294967296) 1))} call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:13:41,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {472#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:13:41,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {462#false} is VALID [2022-04-08 04:13:41,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-04-08 04:13:41,959 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 04:13:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:13:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927316400] [2022-04-08 04:13:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927316400] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:13:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:13:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 04:14:05,829 WARN L232 SmtUtils]: Spent 14.85s on a formula simplification. DAG size of input: 56 DAG size of output: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:14:08,002 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (mod c_main_~i~0 2) 0)) (or (and (= (+ (- 3) c_main_~j~0) 0) (= c_main_~i~0 3)) (let ((.cse0 (div (+ (* (- 1) c_main_~j~0) 3) (- 3)))) (and (= c_main_~i~0 (+ 3 (* 3 .cse0))) (= (mod (* 2 c_main_~j~0) 3) 0) (< 0 .cse0) (forall ((v_it_2 Int)) (let ((.cse2 (+ v_it_2 1))) (or (not (<= 1 v_it_2)) (let ((.cse1 (* v_it_2 3))) (and (< (mod .cse1 4294967296) (mod c_main_~n~0 4294967296)) (not (= (mod .cse2 2) 0)) (let ((.cse3 (mod (+ 3 .cse1) 4294967296))) (<= (mod (div .cse3 2) 4294967296) .cse3)))) (not (<= .cse2 (div (+ (* (- 1) c_main_~j~0) 3) (- 3)))))))))) (<= c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) 20000001)) (< (mod (+ c_main_~i~0 4294967293) 4294967296) (mod c_main_~n~0 4294967296))) is different from false [2022-04-08 04:14:21,512 WARN L855 $PredicateComparison]: unable to prove that (and (<= (mod (div (mod c_main_~i~0 4294967296) 2) 4294967296) (mod c_main_~j~0 4294967296)) (exists ((aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55 Int) (aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55 Int)) (let ((.cse0 (+ aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55 (* aux_div_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55 4294967296)))) (and (< aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55 4294967296) (< 0 aux_mod_aux_mod_v_main_~n~0_BEFORE_RETURN_1_44_55) (<= 0 .cse0) (<= .cse0 20000001))))) is different from true [2022-04-08 04:14:21,513 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:14:21,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1879693310] [2022-04-08 04:14:21,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1879693310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:14:21,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:14:21,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:14:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921059370] [2022-04-08 04:14:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:14:21,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 04:14:21,515 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:14:21,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 10 states have internal predecessors, (16), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:14:21,524 WARN L143 InductivityCheck]: Transition 477#(and (= main_~j~0 3) (= main_~i~0 3) (< 0 (mod main_~n~0 4294967296)) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296)))) ( _ , call __VERIFIER_assert((if (if ~i~0 % 4294967296 < 0 && 0 != ~i~0 % 4294967296 % 2 then 1 + ~i~0 % 4294967296 / 2 else ~i~0 % 4294967296 / 2) % 4294967296 <= ~j~0 % 4294967296 then 1 else 0)); , 479#(and (= |__VERIFIER_assert_#in~cond| 1) (< 0 (mod main_~n~0 4294967296)) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296)))) ) not inductive [2022-04-08 04:14:21,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 04:14:21,525 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:14:21,529 INFO L158 Benchmark]: Toolchain (without parser) took 366827.94ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 142.1MB in the beginning and 234.1MB in the end (delta: -92.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:14:21,529 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:14:21,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.46ms. Allocated memory is still 198.2MB. Free memory was 141.9MB in the beginning and 172.8MB in the end (delta: -30.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-04-08 04:14:21,530 INFO L158 Benchmark]: Boogie Preprocessor took 33.90ms. Allocated memory is still 198.2MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:14:21,530 INFO L158 Benchmark]: RCFGBuilder took 244.61ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 159.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:14:21,530 INFO L158 Benchmark]: TraceAbstraction took 366328.40ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 159.2MB in the beginning and 234.1MB in the end (delta: -74.9MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. [2022-04-08 04:14:21,531 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.13ms. Allocated memory is still 198.2MB. Free memory is still 158.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.46ms. Allocated memory is still 198.2MB. Free memory was 141.9MB in the beginning and 172.8MB in the end (delta: -30.9MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.90ms. Allocated memory is still 198.2MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 244.61ms. Allocated memory is still 198.2MB. Free memory was 171.3MB in the beginning and 159.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 366328.40ms. Allocated memory was 198.2MB in the beginning and 275.8MB in the end (delta: 77.6MB). Free memory was 159.2MB in the beginning and 234.1MB in the end (delta: -74.9MB). Peak memory consumption was 3.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:14:21,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...