/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/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:09:32,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:09:32,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:09:32,892 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:09:32,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:09:32,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:09:32,895 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:09:32,897 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:09:32,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:09:32,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:09:32,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:09:32,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:09:32,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:09:32,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:09:32,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:09:32,908 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:09:32,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:09:32,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:09:32,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:09:32,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:09:32,911 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:09:32,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:09:32,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:09:32,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:09:32,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:09:32,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:09:32,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:09:32,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:09:32,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:09:32,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:09:32,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:09:32,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:09:32,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:09:32,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:09:32,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:09:32,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:09:32,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:09:32,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:09:32,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:09:32,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:09:32,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:09:32,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:09:32,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:09:32,931 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:09:32,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:09:32,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:09:32,933 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:09:32,934 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:09:32,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:32,934 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:09:32,935 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:09:32,935 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:09:32,935 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:09:32,935 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:09:32,935 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:09:32,935 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-15 13:09:33,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:09:33,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:09:33,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:09:33,106 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:09:33,106 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:09:33,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-15 13:09:33,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d7f2c52/5f7e4e4925624b1b9cec3a6da734ca2c/FLAGcc9b2d16c [2022-04-15 13:09:33,467 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:09:33,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2022-04-15 13:09:33,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d7f2c52/5f7e4e4925624b1b9cec3a6da734ca2c/FLAGcc9b2d16c [2022-04-15 13:09:33,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2d7f2c52/5f7e4e4925624b1b9cec3a6da734ca2c [2022-04-15 13:09:33,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:09:33,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:09:33,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:33,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:09:33,927 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:09:33,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:33" (1/1) ... [2022-04-15 13:09:33,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@166d081e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:33, skipping insertion in model container [2022-04-15 13:09:33,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:33" (1/1) ... [2022-04-15 13:09:33,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:09:33,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:09:34,055 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/sumt4.c[403,416] [2022-04-15 13:09:34,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:34,074 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:09:34,081 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/sumt4.c[403,416] [2022-04-15 13:09:34,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:34,097 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:09:34,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34 WrapperNode [2022-04-15 13:09:34,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:34,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:09:34,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:09:34,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:09:34,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,112 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,130 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,131 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:09:34,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:09:34,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:09:34,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:09:34,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (1/1) ... [2022-04-15 13:09:34,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:34,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:34,152 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-15 13:09:34,155 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-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:09:34,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:09:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:09:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:09:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:09:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:09:34,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:09:34,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:09:34,217 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:09:34,218 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:09:36,495 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:09:36,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:09:36,499 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:09:36,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:36 BoogieIcfgContainer [2022-04-15 13:09:36,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:09:36,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:09:36,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:09:36,504 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:09:36,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:09:33" (1/3) ... [2022-04-15 13:09:36,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607b0513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:36, skipping insertion in model container [2022-04-15 13:09:36,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:34" (2/3) ... [2022-04-15 13:09:36,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@607b0513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:36, skipping insertion in model container [2022-04-15 13:09:36,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:36" (3/3) ... [2022-04-15 13:09:36,505 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2022-04-15 13:09:36,508 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:09:36,509 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:09:36,542 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:09:36,545 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-15 13:09:36,546 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:09:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-15 13:09:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:09:36,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:36,560 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:36,560 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 1 times [2022-04-15 13:09:36,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:36,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121221580] [2022-04-15 13:09:36,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:09:36,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1709511738, now seen corresponding path program 2 times [2022-04-15 13:09:36,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:36,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533240159] [2022-04-15 13:09:36,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:36,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:37,039 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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 13:09:37,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:09:37,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-15 13:09:37,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#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-15 13:09:37,041 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(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {27#true} is VALID [2022-04-15 13:09:37,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 13:09:37,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #66#return; {27#true} is VALID [2022-04-15 13:09:37,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret5 := main(); {27#true} is VALID [2022-04-15 13:09:37,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 13:09:37,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 13:09:37,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 13:09:37,044 INFO L272 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:09:37,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:09:37,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28#false} is VALID [2022-04-15 13:09:37,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 13:09:37,046 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-15 13:09:37,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:37,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533240159] [2022-04-15 13:09:37,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533240159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:37,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:37,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:09:37,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:37,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2121221580] [2022-04-15 13:09:37,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2121221580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:37,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:37,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:09:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810884770] [2022-04-15 13:09:37,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:37,054 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-15 13:09:37,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:37,057 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-15 13:09:37,069 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-15 13:09:37,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:09:37,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:37,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:09:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:09:37,084 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 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-15 13:09:41,507 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-15 13:09:43,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:09:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:46,148 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 13:09:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:09:46,148 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-15 13:09:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:46,149 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-15 13:09:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-15 13:09:46,173 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-15 13:09:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 68 transitions. [2022-04-15 13:09:46,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 68 transitions. [2022-04-15 13:09:46,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:46,243 INFO L225 Difference]: With dead ends: 51 [2022-04-15 13:09:46,243 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:09:46,245 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-15 13:09:46,247 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:46,248 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 41 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 2 Unknown, 0 Unchecked, 4.5s Time] [2022-04-15 13:09:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:09:46,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:09:46,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:46,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:09:46,267 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:09:46,267 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:09:46,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:46,269 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:09:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:09:46,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:46,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:46,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-15 13:09:46,270 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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 19 states. [2022-04-15 13:09:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:46,271 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-15 13:09:46,271 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:09:46,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:46,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:46,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:46,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 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-15 13:09:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-15 13:09:46,274 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-15 13:09:46,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:46,274 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-15 13:09:46,274 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-15 13:09:46,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-15 13:09:46,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-15 13:09:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:09:46,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:46,300 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:46,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:09:46,300 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1996045709, now seen corresponding path program 1 times [2022-04-15 13:09:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:46,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899662314] [2022-04-15 13:09:47,302 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -46561988, now seen corresponding path program 1 times [2022-04-15 13:09:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:47,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815721824] [2022-04-15 13:09:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:47,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:47,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:47,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {235#(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; {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:47,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:47,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {224#true} #66#return; {229#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:47,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {235#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:47,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {235#(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; {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:47,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:09:47,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {224#true} #66#return; {229#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:47,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {229#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {229#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:47,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {229#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v4~0 := 0;~n~0 := #t~nondet4;havoc #t~nondet4; {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:09:47,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {230#(and (= main_~k~0 0) (= main_~j~0 0) (or (<= ~SIZE~0 20000001) (< (div ~SIZE~0 4294967296) (+ (div main_~n~0 4294967296) 1))) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {231#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} is VALID [2022-04-15 13:09:47,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0)))} [70] L21-2-->L21-3_primed: Formula: (or (and (= v_main_~l~0_In_1 v_main_~l~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1) (= v_main_~v4~0_In_1 v_main_~v4~0_Out_2)) (and (< (mod (+ v_main_~l~0_Out_2 4294967295) 4294967296) (mod v_main_~n~0_In_1 4294967296)) (= (mod (+ v_main_~l~0_Out_2 3) 4) 0) (= (+ (* (- 1) v_main_~l~0_In_1) v_main_~v4~0_In_1) (+ (* (- 1) v_main_~l~0_Out_2) v_main_~v4~0_Out_2)) (= v_main_~n~0_In_1 0) (<= v_main_~l~0_In_1 v_main_~l~0_Out_2))) InVars {main_~l~0=v_main_~l~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~v4~0=v_main_~v4~0_In_1} OutVars{main_~l~0=v_main_~l~0_Out_2, main_~n~0=v_main_~n~0_In_1, main_~v4~0=v_main_~v4~0_Out_2} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {232#(and (= main_~k~0 0) (< 0 (+ main_~l~0 1)) (<= main_~l~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 13:09:47,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(and (= main_~k~0 0) (< 0 (+ main_~l~0 1)) (<= main_~l~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} [69] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_8 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_8, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {232#(and (= main_~k~0 0) (< 0 (+ main_~l~0 1)) (<= main_~l~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-15 13:09:47,839 INFO L272 TraceCheckUtils]: 9: Hoare triple {232#(and (= main_~k~0 0) (< 0 (+ main_~l~0 1)) (<= main_~l~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {233#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:09:47,839 INFO L290 TraceCheckUtils]: 10: Hoare triple {233#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {234#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:09:47,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {234#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {225#false} is VALID [2022-04-15 13:09:47,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {225#false} assume !false; {225#false} is VALID [2022-04-15 13:09:47,840 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-15 13:09:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:47,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815721824] [2022-04-15 13:09:47,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815721824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:47,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:47,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:09:48,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:48,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899662314] [2022-04-15 13:09:48,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899662314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:48,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:48,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:09:48,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191928495] [2022-04-15 13:09:48,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:48,027 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.0) internal successors, (11), 9 states have internal predecessors, (11), 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 15 [2022-04-15 13:09:48,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:48,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 1.0) internal successors, (11), 9 states have internal predecessors, (11), 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-15 13:09:48,034 WARN L143 InductivityCheck]: Transition 239#(and (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (< (mod (+ main_~l~0 4294967295) 4294967296) (mod main_~n~0 4294967296)) (or (<= 0 (div main_~n~0 4294967296)) (<= (+ 4274967295 main_~n~0) 0))) ( _ , assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); , 232#(and (= main_~k~0 0) (< 0 (+ main_~l~0 1)) (<= main_~l~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0)) ) not inductive [2022-04-15 13:09:48,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:09:48,035 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:103) 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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 13:09:48,037 INFO L158 Benchmark]: Toolchain (without parser) took 14112.96ms. Allocated memory was 189.8MB in the beginning and 269.5MB in the end (delta: 79.7MB). Free memory was 133.6MB in the beginning and 154.5MB in the end (delta: -20.9MB). Peak memory consumption was 59.9MB. Max. memory is 8.0GB. [2022-04-15 13:09:48,038 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:09:48,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 164.5MB in the end (delta: -31.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. [2022-04-15 13:09:48,038 INFO L158 Benchmark]: Boogie Preprocessor took 32.18ms. Allocated memory is still 189.8MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:09:48,038 INFO L158 Benchmark]: RCFGBuilder took 2369.44ms. Allocated memory is still 189.8MB. Free memory was 162.9MB in the beginning and 151.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:09:48,039 INFO L158 Benchmark]: TraceAbstraction took 11535.04ms. Allocated memory was 189.8MB in the beginning and 269.5MB in the end (delta: 79.7MB). Free memory was 151.3MB in the beginning and 154.5MB in the end (delta: -3.1MB). Peak memory consumption was 78.1MB. Max. memory is 8.0GB. [2022-04-15 13:09:48,040 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.12ms. Allocated memory is still 189.8MB. Free memory is still 150.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.87ms. Allocated memory is still 189.8MB. Free memory was 133.4MB in the beginning and 164.5MB in the end (delta: -31.0MB). Peak memory consumption was 8.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.18ms. Allocated memory is still 189.8MB. Free memory was 164.5MB in the beginning and 162.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 2369.44ms. Allocated memory is still 189.8MB. Free memory was 162.9MB in the beginning and 151.8MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11535.04ms. Allocated memory was 189.8MB in the beginning and 269.5MB in the end (delta: 79.7MB). Free memory was 151.3MB in the beginning and 154.5MB in the end (delta: -3.1MB). Peak memory consumption was 78.1MB. 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-15 13:09:48,070 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...